Base | Representation |
---|---|
bin | 110000001101001010101000… |
… | …010110010111010010101101 |
3 | 1000210200001110010100010210110 |
4 | 300031022220112113102231 |
5 | 210242042012011200023 |
6 | 2030524301525530233 |
7 | 62441201136540462 |
oct | 6015125026272255 |
9 | 1023601403303713 |
10 | 212011000100013 |
11 | 6160a3a64940a4 |
12 | 1b94119ab73979 |
13 | 913b72290c78a |
14 | 3a4d55c4db669 |
15 | 1979d5ca6da93 |
hex | c0d2a85974ad |
212011000100013 has 4 divisors (see below), whose sum is σ = 282681333466688. Its totient is φ = 141340666733340.
The previous prime is 212011000099981. The next prime is 212011000100023. The reversal of 212011000100013 is 310001000110212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 212011000100013 - 25 = 212011000099981 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212011000100023) 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, 35335166683333 + ... + 35335166683338.
It is an arithmetic number, because the mean of its divisors is an integer number (70670333366672).
Almost surely, 2212011000100013 is an apocalyptic number.
It is an amenable number.
212011000100013 is a deficient number, since it is larger than the sum of its proper divisors (70670333366675).
212011000100013 is an equidigital number, since it uses as much as digits as its factorization.
212011000100013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70670333366674.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 212011000100013 its reverse (310001000110212), we get a palindrome (522012000210225).
The spelling of 212011000100013 in words is "two hundred twelve trillion, eleven billion, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •