Base | Representation |
---|---|
bin | 101111111110011101001010… |
… | …000001010010011000011101 |
3 | 1000200002102010202211112012111 |
4 | 233332131022001102120131 |
5 | 210124011201122431023 |
6 | 2024432035144434021 |
7 | 62305153116304243 |
oct | 5776351201223035 |
9 | 1020072122745174 |
10 | 211000100202013 |
11 | 6125a704891541 |
12 | 1b7b9296778911 |
13 | 90972bb397665 |
14 | 3a16660600793 |
15 | 195d8e443d00d |
hex | bfe74a05261d |
211000100202013 has 8 divisors (see below), whose sum is σ = 211693695396608. Its totient is φ = 210307149915984.
The previous prime is 211000100201963. The next prime is 211000100202043. The reversal of 211000100202013 is 310202001000112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211000100202013 - 213 = 211000100193821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211000100201984 and 211000100202002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211000100202043) 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, 160571706 + ... + 161880427.
It is an arithmetic number, because the mean of its divisors is an integer number (26461711924576).
Almost surely, 2211000100202013 is an apocalyptic number.
It is an amenable number.
211000100202013 is a deficient number, since it is larger than the sum of its proper divisors (693595194595).
211000100202013 is a wasteful number, since it uses less digits than its factorization.
211000100202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322454283.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 211000100202013 its reverse (310202001000112), we get a palindrome (521202101202125).
The spelling of 211000100202013 in words is "two hundred eleven trillion, one hundred million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •