Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …100011010011001101110 |
3 | 21010011201211100212022122 |
4 | 131100022210122121232 |
5 | 230413413313341024 |
6 | 4135252214112542 |
7 | 265143114113246 |
oct | 35201244323156 |
9 | 7104654325278 |
10 | 2010222012014 |
11 | 705591a127a7 |
12 | 28571734b752 |
13 | 117742244ca8 |
14 | 6d41c2c4b26 |
15 | 374555e1d5e |
hex | 1d40a91a66e |
2010222012014 has 8 divisors (see below), whose sum is σ = 3015808866768. Its totient is φ = 1004952389760.
The previous prime is 2010222011953. The next prime is 2010222012017. The reversal of 2010222012014 is 4102102220102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×20102220120142 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2010222011983 and 2010222012001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010222012017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79292282 + ... + 79317629.
It is an arithmetic number, because the mean of its divisors is an integer number (376976108346).
Almost surely, 22010222012014 is an apocalyptic number.
2010222012014 is a deficient number, since it is larger than the sum of its proper divisors (1005586854754).
2010222012014 is a wasteful number, since it uses less digits than its factorization.
2010222012014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158616250.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2010222012014 its reverse (4102102220102), we get a palindrome (6112324232116).
The spelling of 2010222012014 in words is "two trillion, ten billion, two hundred twenty-two million, twelve thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •