Base | Representation |
---|---|
bin | 101101101100111101000100… |
… | …011110000010100111100000 |
3 | 222100200112112210220120121212 |
4 | 231230331010132002213200 |
5 | 202321201202220224412 |
6 | 1551254422205005252 |
7 | 60223603111216325 |
oct | 5554750436024740 |
9 | 870615483816555 |
10 | 201001323211232 |
11 | 5905520094a445 |
12 | 1a6634a0553828 |
13 | 882046072b63b |
14 | 378c731ab0b4c |
15 | 183878ba7d222 |
hex | b6cf447829e0 |
201001323211232 has 12 divisors (see below), whose sum is σ = 395721355072176. Its totient is φ = 100500661605600.
The previous prime is 201001323211231. The next prime is 201001323211237. The reversal of 201001323211232 is 232112323100102.
It is a junction number, because it is equal to n+sod(n) for n = 201001323211198 and 201001323211207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201001323211231) 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, 3140645675144 + ... + 3140645675207.
It is an arithmetic number, because the mean of its divisors is an integer number (32976779589348).
Almost surely, 2201001323211232 is an apocalyptic number.
It is an amenable number.
201001323211232 is a deficient number, since it is larger than the sum of its proper divisors (194720031860944).
201001323211232 is an equidigital number, since it uses as much as digits as its factorization.
201001323211232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6281291350361 (or 6281291350353 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 201001323211232 its reverse (232112323100102), we get a palindrome (433113646311334).
The spelling of 201001323211232 in words is "two hundred one trillion, one billion, three hundred twenty-three million, two hundred eleven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •