Base | Representation |
---|---|
bin | 10001011101111000101… |
… | …110000010011101101111 |
3 | 11020202020110010021120101 |
4 | 101131320232002131233 |
5 | 124131224212211343 |
6 | 2315230413131531 |
7 | 152502035642002 |
oct | 21357056023557 |
9 | 4222213107511 |
10 | 1200321210223 |
11 | 423065038093 |
12 | 174769189ba7 |
13 | 89261000a25 |
14 | 4214b05d539 |
15 | 21352ed8e4d |
hex | 11778b8276f |
1200321210223 has 2 divisors, whose sum is σ = 1200321210224. Its totient is φ = 1200321210222.
The previous prime is 1200321210163. The next prime is 1200321210259. The reversal of 1200321210223 is 3220121230021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1200321210223 - 229 = 1199784339311 is a prime.
It is a super-2 number, since 2×12003212102232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1200321210223.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1200321210923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 600160605111 + 600160605112.
It is an arithmetic number, because the mean of its divisors is an integer number (600160605112).
Almost surely, 21200321210223 is an apocalyptic number.
1200321210223 is a deficient number, since it is larger than the sum of its proper divisors (1).
1200321210223 is an equidigital number, since it uses as much as digits as its factorization.
1200321210223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1200321210223 its reverse (3220121230021), we get a palindrome (4420442440244).
The spelling of 1200321210223 in words is "one trillion, two hundred billion, three hundred twenty-one million, two hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •