Base | Representation |
---|---|
bin | 101101101101011000101101… |
… | …010110000101010101100011 |
3 | 222100210101011001001200102022 |
4 | 231231120231112011111203 |
5 | 202322142442001122243 |
6 | 1551320211054012055 |
7 | 60226003405016534 |
oct | 5555305526052543 |
9 | 870711131050368 |
10 | 201031000020323 |
11 | 5906684a70a350 |
12 | 1a6691a31a702b |
13 | 88231acb65cc5 |
14 | 378dd4922a68b |
15 | 1839427116b68 |
hex | b6d62d585563 |
201031000020323 has 8 divisors (see below), whose sum is σ = 219306655454256. Its totient is φ = 182755362916000.
The previous prime is 201031000020313. The next prime is 201031000020329. The reversal of 201031000020323 is 323020000130102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201031000020323 - 210 = 201031000019299 is a prime.
It is a super-2 number, since 2×2010310000203232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201031000020329) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29139065 + ... + 35371557.
It is an arithmetic number, because the mean of its divisors is an integer number (27413331931782).
Almost surely, 2201031000020323 is an apocalyptic number.
201031000020323 is a deficient number, since it is larger than the sum of its proper divisors (18275655433933).
201031000020323 is a wasteful number, since it uses less digits than its factorization.
201031000020323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9164805.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 201031000020323 its reverse (323020000130102), we get a palindrome (524051000150425).
The spelling of 201031000020323 in words is "two hundred one trillion, thirty-one billion, twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •