Base | Representation |
---|---|
bin | 1001000110001100110011… |
… | …0100101010010110011111 |
3 | 1022102012012221210200210020 |
4 | 2101203030310222112133 |
5 | 2302333320234101421 |
6 | 33134524404443223 |
7 | 2051425602054003 |
oct | 221431464522637 |
9 | 38365187720706 |
10 | 10002120222111 |
11 | 320696a1242a6 |
12 | 11565899a9513 |
13 | 5772714a6914 |
14 | 268168960703 |
15 | 1252a1151dc6 |
hex | 918ccd2a59f |
10002120222111 has 4 divisors (see below), whose sum is σ = 13336160296152. Its totient is φ = 6668080148072.
The previous prime is 10002120222097. The next prime is 10002120222121. The reversal of 10002120222111 is 11122202120001.
10002120222111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10002120222111 - 218 = 10002119959967 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002120222121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1667020037016 + ... + 1667020037021.
It is an arithmetic number, because the mean of its divisors is an integer number (3334040074038).
Almost surely, 210002120222111 is an apocalyptic number.
10002120222111 is a deficient number, since it is larger than the sum of its proper divisors (3334040074041).
10002120222111 is an equidigital number, since it uses as much as digits as its factorization.
10002120222111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3334040074040.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10002120222111 its reverse (11122202120001), we get a palindrome (21124322342112).
The spelling of 10002120222111 in words is "ten trillion, two billion, one hundred twenty million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •