Base | Representation |
---|---|
bin | 11101000111101010111… |
… | …110110010010010100011 |
3 | 21002022012020200100112000 |
4 | 131013222332302102203 |
5 | 230241224120320344 |
6 | 4131143231135043 |
7 | 264401114241135 |
oct | 35075276622243 |
9 | 7068166610460 |
10 | 2001102120099 |
11 | 701731a83a45 |
12 | 2839b1074483 |
13 | 11691a9a8044 |
14 | 6cbd4dc1055 |
15 | 370beb31a69 |
hex | 1d1eafb24a3 |
2001102120099 has 8 divisors (see below), whose sum is σ = 2964595733520. Its totient is φ = 1334068080048.
The previous prime is 2001102120053. The next prime is 2001102120163. The reversal of 2001102120099 is 9900212011002.
It is not a de Polignac number, because 2001102120099 - 211 = 2001102118051 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 74114893337 = 2001102120099 / (2 + 0 + 0 + 1 + 1 + 0 + 2 + 1 + 2 + 0 + 0 + 9 + 9).
It is not an unprimeable number, because it can be changed into a prime (2001102120799) 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 7 ways as a sum of consecutive naturals, for example, 37057446642 + ... + 37057446695.
It is an arithmetic number, because the mean of its divisors is an integer number (370574466690).
Almost surely, 22001102120099 is an apocalyptic number.
2001102120099 is a deficient number, since it is larger than the sum of its proper divisors (963493613421).
2001102120099 is an equidigital number, since it uses as much as digits as its factorization.
2001102120099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74114893346 (or 74114893340 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 2001102120099 in words is "two trillion, one billion, one hundred two million, one hundred twenty thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •