Base | Representation |
---|---|
bin | 11110100101101110111… |
… | …011100101001000100101 |
3 | 21102221212222020100101202 |
4 | 132211232323211020211 |
5 | 233420100112320401 |
6 | 4245405204532245 |
7 | 304605000130502 |
oct | 36455673451045 |
9 | 7387788210352 |
10 | 2102100120101 |
11 | 74054a797233 |
12 | 29b4990b1085 |
13 | 1232c51a4517 |
14 | 73a567cc4a9 |
15 | 39a317a506b |
hex | 1e96eee5225 |
2102100120101 has 8 divisors (see below), whose sum is σ = 2143376446464. Its totient is φ = 2060883573840.
The previous prime is 2102100120091. The next prime is 2102100120119. The reversal of 2102100120101 is 1010210012012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2102100120101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102100120191) 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, 14874005 + ... + 15014666.
It is an arithmetic number, because the mean of its divisors is an integer number (267922055808).
Almost surely, 22102100120101 is an apocalyptic number.
It is an amenable number.
2102100120101 is a deficient number, since it is larger than the sum of its proper divisors (41276326363).
2102100120101 is a wasteful number, since it uses less digits than its factorization.
2102100120101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29890051.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2102100120101 its reverse (1010210012012), we get a palindrome (3112310132113).
The spelling of 2102100120101 in words is "two trillion, one hundred two billion, one hundred million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •