Base | Representation |
---|---|
bin | 11101000110101010000… |
… | …000011001000111000101 |
3 | 21002012101021110122100020 |
4 | 131012222000121013011 |
5 | 230232011034202323 |
6 | 4130443130405353 |
7 | 264332106456162 |
oct | 35065200310705 |
9 | 7065337418306 |
10 | 2000012022213 |
11 | 7012227122a7 |
12 | 283747b90859 |
13 | 1167a5bb34ca |
14 | 6cb302dd069 |
15 | 370590a4ae3 |
hex | 1d1aa0191c5 |
2000012022213 has 8 divisors (see below), whose sum is σ = 2666999100000. Its totient is φ = 1333183146288.
The previous prime is 2000012022157. The next prime is 2000012022227. The reversal of 2000012022213 is 3122202100002.
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 2000012022213 - 212 = 2000012018117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000012022192 and 2000012022201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000012022233) 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 7 ways as a sum of consecutive naturals, for example, 39520963 + ... + 39571536.
It is an arithmetic number, because the mean of its divisors is an integer number (333374887500).
Almost surely, 22000012022213 is an apocalyptic number.
It is an amenable number.
2000012022213 is a deficient number, since it is larger than the sum of its proper divisors (666987077787).
2000012022213 is an equidigital number, since it uses as much as digits as its factorization.
2000012022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79100931.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2000012022213 its reverse (3122202100002), we get a palindrome (5122214122215).
The spelling of 2000012022213 in words is "two trillion, twelve million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •