Base | Representation |
---|---|
bin | 10110110010001000011001… |
… | …010010001000101011010011 |
3 | 111010210012220110000202210211 |
4 | 112302020121102020223103 |
5 | 101113202204331401321 |
6 | 553040100215504551 |
7 | 30051233151046564 |
oct | 2662103122105323 |
9 | 433705813022724 |
10 | 100202011200211 |
11 | 29a22486074908 |
12 | b2a39a2988157 |
13 | 43bb0170313cb |
14 | 1aa5b3606616b |
15 | b8b73e5ba0e1 |
hex | 5b2219488ad3 |
100202011200211 has 8 divisors (see below), whose sum is σ = 105528884242880. Its totient is φ = 94880446455528.
The previous prime is 100202011200199. The next prime is 100202011200259. The reversal of 100202011200211 is 112002110202001.
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-100202011200211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100202011200191 and 100202011200200.
It is not an unprimeable number, because it can be changed into a prime (100202011200611) 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, 1327035741 + ... + 1327111246.
It is an arithmetic number, because the mean of its divisors is an integer number (13191110530360).
Almost surely, 2100202011200211 is an apocalyptic number.
100202011200211 is a deficient number, since it is larger than the sum of its proper divisors (5326873042669).
100202011200211 is a wasteful number, since it uses less digits than its factorization.
100202011200211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2654148993.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100202011200211 its reverse (112002110202001), we get a palindrome (212204121402212).
The spelling of 100202011200211 in words is "one hundred trillion, two hundred two billion, eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •