Base | Representation |
---|---|
bin | 11110100011111101110… |
… | …011100101111110101001 |
3 | 21102202222200222001211202 |
4 | 132203331303211332221 |
5 | 233402203230413001 |
6 | 4244453005533545 |
7 | 304506653105612 |
oct | 36437563457651 |
9 | 7382880861752 |
10 | 2100202201001 |
11 | 73a766432553 |
12 | 29b0495742b5 |
13 | 123081c1bb78 |
14 | 73916706c09 |
15 | 3996ed5896b |
hex | 1e8fdce5fa9 |
2100202201001 has 8 divisors (see below), whose sum is σ = 2115566428104. Its totient is φ = 2084838471040.
The previous prime is 2100202200983. The next prime is 2100202201021. The reversal of 2100202201001 is 1001022020012.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 616105685776 + 1484096515225 = 784924^2 + 1218235^2 .
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-2100202201001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2100202201021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15581171 + ... + 15715383.
It is an arithmetic number, because the mean of its divisors is an integer number (264445803513).
Almost surely, 22100202201001 is an apocalyptic number.
It is an amenable number.
2100202201001 is a deficient number, since it is larger than the sum of its proper divisors (15364227103).
2100202201001 is a wasteful number, since it uses less digits than its factorization.
2100202201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248571.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2100202201001 its reverse (1001022020012), we get a palindrome (3101224221013).
The spelling of 2100202201001 in words is "two trillion, one hundred billion, two hundred two million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •