Base | Representation |
---|---|
bin | 11110100011111110010… |
… | …010100110100111110101 |
3 | 21102210000021021001212112 |
4 | 132203332102212213311 |
5 | 233402212321030401 |
6 | 4244453500100405 |
7 | 304510112153612 |
oct | 36437622464765 |
9 | 7383007231775 |
10 | 2100210330101 |
11 | 73a76aa85014 |
12 | 29b050234705 |
13 | 123083806ca0 |
14 | 73917821509 |
15 | 399709123bb |
hex | 1e8fe4a69f5 |
2100210330101 has 4 divisors (see below), whose sum is σ = 2261764970892. Its totient is φ = 1938655689312.
The previous prime is 2100210329957. The next prime is 2100210330103. The reversal of 2100210330101 is 1010330120012.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 81011959876 + 2019198370225 = 284626^2 + 1420985^2 .
It is a cyclic number.
It is not a de Polignac number, because 2100210330101 - 218 = 2100210067957 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 (2100210330103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80777320376 + ... + 80777320401.
It is an arithmetic number, because the mean of its divisors is an integer number (565441242723).
Almost surely, 22100210330101 is an apocalyptic number.
It is an amenable number.
2100210330101 is a deficient number, since it is larger than the sum of its proper divisors (161554640791).
2100210330101 is a wasteful number, since it uses less digits than its factorization.
2100210330101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161554640790.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 2100210330101 its reverse (1010330120012), we get a palindrome (3110540450113).
The spelling of 2100210330101 in words is "two trillion, one hundred billion, two hundred ten million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •