Base | Representation |
---|---|
bin | 1010111010011111111100… |
… | …0101100011010100110101 |
3 | 1120111012102020002120000102 |
4 | 2232213333011203110311 |
5 | 3033102223031200341 |
6 | 41304440332523445 |
7 | 2345660146042064 |
oct | 256477705432465 |
9 | 46435366076012 |
10 | 12000123303221 |
11 | 3907250842399 |
12 | 1419855020585 |
13 | 6907b7102181 |
14 | 2d6b481181db |
15 | 15c23db79c9b |
hex | ae9ff163535 |
12000123303221 has 2 divisors, whose sum is σ = 12000123303222. Its totient is φ = 12000123303220.
The previous prime is 12000123303197. The next prime is 12000123303251. The reversal of 12000123303221 is 12230332100021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11999503840900 + 619462321 = 3464030^2 + 24889^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000123303221 - 230 = 11999049561397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12000123303193 and 12000123303202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000123303251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000061651610 + 6000061651611.
It is an arithmetic number, because the mean of its divisors is an integer number (6000061651611).
Almost surely, 212000123303221 is an apocalyptic number.
It is an amenable number.
12000123303221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000123303221 is an equidigital number, since it uses as much as digits as its factorization.
12000123303221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12000123303221 its reverse (12230332100021), we get a palindrome (24230455403242).
The spelling of 12000123303221 in words is "twelve trillion, one hundred twenty-three million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.227 sec. • engine limits •