Base | Representation |
---|---|
bin | 101101101111110111001110… |
… | …101001101111110011011011 |
3 | 222101101122111021020010110210 |
4 | 231233313032221233303123 |
5 | 202332440034232000243 |
6 | 1551530320533142203 |
7 | 60244210356155625 |
oct | 5557671651576333 |
9 | 871348437203423 |
10 | 201201210031323 |
11 | 59121a54837927 |
12 | 1a69618618a963 |
13 | 8836267470c48 |
14 | 3798294b2dc15 |
15 | 183da8a0e7933 |
hex | b6fdcea6fcdb |
201201210031323 has 16 divisors (see below), whose sum is σ = 268321661575200. Its totient is φ = 134107450907136.
The previous prime is 201201210031307. The next prime is 201201210031333. The reversal of 201201210031323 is 323130012102102.
It is not a de Polignac number, because 201201210031323 - 24 = 201201210031307 is a prime.
It is a super-2 number, since 2×2012012100313232 (a number of 29 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 201201210031323.
It is not an unprimeable number, because it can be changed into a prime (201201210031333) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 531457603 + ... + 531836051.
It is an arithmetic number, because the mean of its divisors is an integer number (16770103848450).
Almost surely, 2201201210031323 is an apocalyptic number.
201201210031323 is a deficient number, since it is larger than the sum of its proper divisors (67120451543877).
201201210031323 is a wasteful number, since it uses less digits than its factorization.
201201210031323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413246.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 201201210031323 its reverse (323130012102102), we get a palindrome (524331222133425).
The spelling of 201201210031323 in words is "two hundred one trillion, two hundred one billion, two hundred ten million, thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •