Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …001011001011110110000011 |
3 | 111010210222120001011002222211 |
4 | 112302033312023023312003 |
5 | 101113320101100011321 |
6 | 553043502151042551 |
7 | 30051635342500033 |
oct | 2662176613136603 |
9 | 433728501132884 |
10 | 100210012110211 |
11 | 29a25911403a23 |
12 | b2a5456370457 |
13 | 43bb9c0802793 |
14 | 1aa62948c98c3 |
15 | b8ba5bbe50e1 |
hex | 5b23f62cbd83 |
100210012110211 has 8 divisors (see below), whose sum is σ = 101913721920000. Its totient is φ = 98506476801480.
The previous prime is 100210012110199. The next prime is 100210012110239. The reversal of 100210012110211 is 112011210012001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100210012110211 - 25 = 100210012110179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100210012110191 and 100210012110200.
It is not an unprimeable number, because it can be changed into a prime (100210012110011) 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, 42466711 + ... + 44764288.
It is an arithmetic number, because the mean of its divisors is an integer number (12739215240000).
Almost surely, 2100210012110211 is an apocalyptic number.
100210012110211 is a deficient number, since it is larger than the sum of its proper divisors (1703709809789).
100210012110211 is an equidigital number, since it uses as much as digits as its factorization.
100210012110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87250529.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 100210012110211 its reverse (112011210012001), we get a palindrome (212221222122212).
The spelling of 100210012110211 in words is "one hundred trillion, two hundred ten billion, twelve million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •