Base | Representation |
---|---|
bin | 101111111110100110011000… |
… | …101100010010100011000011 |
3 | 1000200010100201101221001202201 |
4 | 233332212120230102203003 |
5 | 210124142000032013243 |
6 | 2024440354350454031 |
7 | 62305653520415635 |
oct | 5776463054224303 |
9 | 1020110641831681 |
10 | 211010010032323 |
11 | 6126392a709747 |
12 | 1b7bb1a1504317 |
13 | 909820a4a3888 |
14 | 3a16d207b0a55 |
15 | 195dcc443904d |
hex | bfe998b128c3 |
211010010032323 has 8 divisors (see below), whose sum is σ = 211905835328880. Its totient is φ = 210114352216320.
The previous prime is 211010010032267. The next prime is 211010010032383. The reversal of 211010010032323 is 323230010010112.
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 211010010032323 - 213 = 211010010024131 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 211010010032323.
It is not an unprimeable number, because it can be changed into a prime (211010010032383) 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, 39344653 + ... + 44384926.
It is an arithmetic number, because the mean of its divisors is an integer number (26488229416110).
Almost surely, 2211010010032323 is an apocalyptic number.
211010010032323 is a deficient number, since it is larger than the sum of its proper divisors (895825296557).
211010010032323 is a wasteful number, since it uses less digits than its factorization.
211010010032323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83740277.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 211010010032323 its reverse (323230010010112), we get a palindrome (534240020042435).
The spelling of 211010010032323 in words is "two hundred eleven trillion, ten billion, ten million, thirty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •