Base | Representation |
---|---|
bin | 101111101111111001110101… |
… | …011111101110010011010011 |
3 | 1000112112210222012012200021011 |
4 | 233233321311133232103103 |
5 | 210011120202132033021 |
6 | 2022344414245311351 |
7 | 62143002204564424 |
oct | 5757716537562323 |
9 | 1015483865180234 |
10 | 210000102221011 |
11 | 60a045a8015543 |
12 | 1b677515405557 |
13 | 9023c03657abb |
14 | 39c00b856164b |
15 | 19428b7e74de1 |
hex | befe757ee4d3 |
210000102221011 has 8 divisors (see below), whose sum is σ = 211487066300880. Its totient is φ = 208516624576512.
The previous prime is 210000102220999. The next prime is 210000102221113. The reversal of 210000102221011 is 110122201000012.
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 210000102221011 - 227 = 209999968003283 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210000102220982 and 210000102221000.
It is not an unprimeable number, because it can be changed into a prime (210000102227011) 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, 871487950 + ... + 871728883.
It is an arithmetic number, because the mean of its divisors is an integer number (26435883287610).
Almost surely, 2210000102221011 is an apocalyptic number.
210000102221011 is a deficient number, since it is larger than the sum of its proper divisors (1486964079869).
210000102221011 is a wasteful number, since it uses less digits than its factorization.
210000102221011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1743217685.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210000102221011 its reverse (110122201000012), we get a palindrome (320122303221023).
The spelling of 210000102221011 in words is "two hundred ten trillion, one hundred two million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •