Base | Representation |
---|---|
bin | 11110100011111000010… |
… | …011111000011110110101 |
3 | 21102202202021110212201200 |
4 | 132203320103320132311 |
5 | 233402011130031401 |
6 | 4244435513443113 |
7 | 304504453324266 |
oct | 36437023703665 |
9 | 7382667425650 |
10 | 2100110002101 |
11 | 73a71938a111 |
12 | 29b022710499 |
13 | 123068aaa0c7 |
14 | 7390838696d |
15 | 39966be5686 |
hex | 1e8f84f87b5 |
2100110002101 has 12 divisors (see below), whose sum is σ = 3034662136428. Its totient is φ = 1399533375744.
The previous prime is 2100110002097. The next prime is 2100110002103. The reversal of 2100110002101 is 1012000110012.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1626007522500 + 474102479601 = 1275150^2 + 688551^2 .
It is not a de Polignac number, because 2100110002101 - 22 = 2100110002097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100110002103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 44971950 + ... + 45018623.
It is an arithmetic number, because the mean of its divisors is an integer number (252888511369).
Almost surely, 22100110002101 is an apocalyptic number.
It is an amenable number.
2100110002101 is a deficient number, since it is larger than the sum of its proper divisors (934552134327).
2100110002101 is a wasteful number, since it uses less digits than its factorization.
2100110002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89993172 (or 89993169 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2100110002101 its reverse (1012000110012), we get a palindrome (3112110112113).
The spelling of 2100110002101 in words is "two trillion, one hundred billion, one hundred ten million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •