Base | Representation |
---|---|
bin | 10011010111100110100… |
… | …000101101111101101111 |
3 | 11201020120112100000112011 |
4 | 103113212200231331233 |
5 | 133301403112343043 |
6 | 2455243015222051 |
7 | 165106503202156 |
oct | 23274640557557 |
9 | 4636515300464 |
10 | 1331012231023 |
11 | 47352a783392 |
12 | 195b61377927 |
13 | 9868b0bc8b7 |
14 | 485c820659d |
15 | 2495184959d |
hex | 135e682df6f |
1331012231023 has 32 divisors (see below), whose sum is σ = 1565374118400. Its totient is φ = 1122430104576.
The previous prime is 1331012230981. The next prime is 1331012231033. The reversal of 1331012231023 is 3201322101331.
It is a cyclic number.
It is not a de Polignac number, because 1331012231023 - 29 = 1331012230511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1331012230985 and 1331012231003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331012231033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 345361 + ... + 1667722.
It is an arithmetic number, because the mean of its divisors is an integer number (48917941200).
Almost surely, 21331012231023 is an apocalyptic number.
1331012231023 is a deficient number, since it is larger than the sum of its proper divisors (234361887377).
1331012231023 is a wasteful number, since it uses less digits than its factorization.
1331012231023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2013231.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1331012231023 its reverse (3201322101331), we get a palindrome (4532334332354).
The spelling of 1331012231023 in words is "one trillion, three hundred thirty-one billion, twelve million, two hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •