Base | Representation |
---|---|
bin | 110000000000000100011110… |
… | …001000011001111011011011 |
3 | 1000200111000110212111120110110 |
4 | 300000010132020121323123 |
5 | 210132320343423120443 |
6 | 2024555023020015403 |
7 | 62316161125560105 |
oct | 6000043610317333 |
9 | 1020430425446413 |
10 | 211111033020123 |
11 | 612a2760539705 |
12 | 1b816895991563 |
13 | 90a48b9c0b832 |
14 | 3a1bb85644575 |
15 | 1961738396233 |
hex | c0011e219edb |
211111033020123 has 8 divisors (see below), whose sum is σ = 281567747848000. Its totient is φ = 140697503436168.
The previous prime is 211111033020109. The next prime is 211111033020127. The reversal of 211111033020123 is 321020330111112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211111033020123 - 25 = 211111033020091 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 211111033020123.
It is not an unprimeable number, because it can be changed into a prime (211111033020127) 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, 10796299573 + ... + 10796319126.
It is an arithmetic number, because the mean of its divisors is an integer number (35195968481000).
Almost surely, 2211111033020123 is an apocalyptic number.
211111033020123 is a deficient number, since it is larger than the sum of its proper divisors (70456714827877).
211111033020123 is a wasteful number, since it uses less digits than its factorization.
211111033020123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21592621961.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 211111033020123 its reverse (321020330111112), we get a palindrome (532131363131235).
The spelling of 211111033020123 in words is "two hundred eleven trillion, one hundred eleven billion, thirty-three million, twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •