Base | Representation |
---|---|
bin | 1001000110000101101110… |
… | …0011111110010011110001 |
3 | 1022102000022112020112021101 |
4 | 2101201123203332103301 |
5 | 2302320422311201001 |
6 | 33134012044524401 |
7 | 2051330526451666 |
oct | 221413343762361 |
9 | 38360275215241 |
10 | 10000220022001 |
11 | 3206084551890 |
12 | 1156139550701 |
13 | 57702a902c61 |
14 | 268028443a6d |
15 | 1251de404a01 |
hex | 9185b8fe4f1 |
10000220022001 has 32 divisors (see below), whose sum is σ = 11514946360320. Its totient is φ = 8589078388800.
The previous prime is 10000220021977. The next prime is 10000220022041. The reversal of 10000220022001 is 10022002200001.
It is a cyclic number.
It is not a de Polignac number, because 10000220022001 - 25 = 10000220021969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10000220022041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 127659636 + ... + 127737946.
It is an arithmetic number, because the mean of its divisors is an integer number (359842073760).
Almost surely, 210000220022001 is an apocalyptic number.
10000220022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10000220022001 is a deficient number, since it is larger than the sum of its proper divisors (1514726338319).
10000220022001 is a wasteful number, since it uses less digits than its factorization.
10000220022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80005.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10000220022001 its reverse (10022002200001), we get a palindrome (20022222222002).
The spelling of 10000220022001 in words is "ten trillion, two hundred twenty million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •