Base | Representation |
---|---|
bin | 10110111101111001111010… |
… | …101111010110110101110010 |
3 | 111020122120022020112120010201 |
4 | 112331321322233112311302 |
5 | 101214431213111231002 |
6 | 554455505254545414 |
7 | 30163545140202556 |
oct | 2675717257266562 |
9 | 436576266476121 |
10 | 101011100102002 |
11 | 2a204626720a92 |
12 | b3b476506826a |
13 | 44493c8cb717c |
14 | 1ad2d6b545866 |
15 | ba27e579a087 |
hex | 5bde7abd6d72 |
101011100102002 has 4 divisors (see below), whose sum is σ = 151516650153006. Its totient is φ = 50505550051000.
The previous prime is 101011100101949. The next prime is 101011100102023. The reversal of 101011100102002 is 200201001110101.
101011100102002 is digitally balanced in base 3, 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 can be written as a sum of positive squares in only one way, i.e., 100076434600041 + 934665501961 = 10003821^2 + 966781^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 101011100102002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25252775025499 + ... + 25252775025502.
Almost surely, 2101011100102002 is an apocalyptic number.
101011100102002 is a deficient number, since it is larger than the sum of its proper divisors (50505550051004).
101011100102002 is an equidigital number, since it uses as much as digits as its factorization.
101011100102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50505550051003.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101011100102002 its reverse (200201001110101), we get a palindrome (301212101212103).
The spelling of 101011100102002 in words is "one hundred one trillion, eleven billion, one hundred million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •