Base | Representation |
---|---|
bin | 1010111010100000101101… |
… | …1101111100001110101101 |
3 | 1120111012221200221211100211 |
4 | 2232220023131330032231 |
5 | 3033103134220221102 |
6 | 41304513113022421 |
7 | 2345665250451652 |
oct | 256501335741655 |
9 | 46435850854324 |
10 | 12000331023277 |
11 | 3907348018563 |
12 | 14198b26b4a11 |
13 | 69081b16034c |
14 | 2d6b67949c29 |
15 | 15c25200b7d7 |
hex | aea0b77c3ad |
12000331023277 has 2 divisors, whose sum is σ = 12000331023278. Its totient is φ = 12000331023276.
The previous prime is 12000331023269. The next prime is 12000331023349. The reversal of 12000331023277 is 77232013300021.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8081221877001 + 3919109146276 = 2842749^2 + 1979674^2 .
It is an emirp because it is prime and its reverse (77232013300021) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12000331023277 - 23 = 12000331023269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000331023077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000165511638 + 6000165511639.
It is an arithmetic number, because the mean of its divisors is an integer number (6000165511639).
Almost surely, 212000331023277 is an apocalyptic number.
It is an amenable number.
12000331023277 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000331023277 is an equidigital number, since it uses as much as digits as its factorization.
12000331023277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10584, while the sum is 31.
Adding to 12000331023277 its reverse (77232013300021), we get a palindrome (89232344323298).
The spelling of 12000331023277 in words is "twelve trillion, three hundred thirty-one million, twenty-three thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •