Base | Representation |
---|---|
bin | 10010001110010011000… |
… | …110011010000010110111 |
3 | 11102201102011210210210212 |
4 | 102032103012122002313 |
5 | 131004204133212211 |
6 | 2355144504140035 |
7 | 156322150244600 |
oct | 22162306320267 |
9 | 4381364723725 |
10 | 1252303413431 |
11 | 44310a6a1804 |
12 | 182855a6761b |
13 | 91126626455 |
14 | 4487cb34da7 |
15 | 228968c838b |
hex | 1239319a0b7 |
1252303413431 has 36 divisors (see below), whose sum is σ = 1528650989712. Its totient is φ = 1022823736704.
The previous prime is 1252303413379. The next prime is 1252303413457. The reversal of 1252303413431 is 1343143032521.
It is not a de Polignac number, because 1252303413431 - 210 = 1252303412407 is a prime.
It is a super-2 number, since 2×12523034134312 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1252303412431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6725375 + ... + 6909071.
It is an arithmetic number, because the mean of its divisors is an integer number (42462527492).
Almost surely, 21252303413431 is an apocalyptic number.
1252303413431 is a deficient number, since it is larger than the sum of its proper divisors (276347576281).
1252303413431 is a wasteful number, since it uses less digits than its factorization.
1252303413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184020 (or 183990 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 1252303413431 its reverse (1343143032521), we get a palindrome (2595446445952).
The spelling of 1252303413431 in words is "one trillion, two hundred fifty-two billion, three hundred three million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •