Base | Representation |
---|---|
bin | 1100010110111000100… |
… | …0000101110000101101 |
3 | 202021222121210211200221 |
4 | 3011232020011300231 |
5 | 11434243024341023 |
6 | 241310231251341 |
7 | 21224005553536 |
oct | 3055610056055 |
9 | 667877724627 |
10 | 212301012013 |
11 | 82044428632 |
12 | 3518b219b51 |
13 | 170349472cc |
14 | a3bda9768d |
15 | 57c835385d |
hex | 316e205c2d |
212301012013 has 4 divisors (see below), whose sum is σ = 212475459420. Its totient is φ = 212126564608.
The previous prime is 212301011969. The next prime is 212301012047. The reversal of 212301012013 is 310210103212.
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 36091640484 + 176209371529 = 189978^2 + 419773^2 .
It is a cyclic number.
It is not a de Polignac number, because 212301012013 - 229 = 211764141101 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 (212301012113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87221878 + ... + 87224311.
It is an arithmetic number, because the mean of its divisors is an integer number (53118864855).
Almost surely, 2212301012013 is an apocalyptic number.
It is an amenable number.
212301012013 is a deficient number, since it is larger than the sum of its proper divisors (174447407).
212301012013 is a wasteful number, since it uses less digits than its factorization.
212301012013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174447406.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 212301012013 its reverse (310210103212), we get a palindrome (522511115225).
The spelling of 212301012013 in words is "two hundred twelve billion, three hundred one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •