Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …100110111011101001100 |
3 | 21010011201211120220120021 |
4 | 131100022210313131030 |
5 | 230413413331143040 |
6 | 4135252220431524 |
7 | 265143115120225 |
oct | 35201244673514 |
9 | 7104654526507 |
10 | 2010222131020 |
11 | 705591a94154 |
12 | 2857173a85a4 |
13 | 1177422871cc |
14 | 6d41c31624c |
15 | 3745561724a |
hex | 1d40a93774c |
2010222131020 has 24 divisors (see below), whose sum is σ = 4221504275184. Its totient is φ = 804081652416.
The previous prime is 2010222131011. The next prime is 2010222131023. The reversal of 2010222131020 is 201312220102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2010222130985 and 2010222131003.
It is not an unprimeable number, because it can be changed into a prime (2010222131023) 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, 2228182 + ... + 2997538.
It is an arithmetic number, because the mean of its divisors is an integer number (175896011466).
Almost surely, 22010222131020 is an apocalyptic number.
2010222131020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2010222131020 is an abundant number, since it is smaller than the sum of its proper divisors (2211282144164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2010222131020 is a wasteful number, since it uses less digits than its factorization.
2010222131020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 900009 (or 900007 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 2010222131020 its reverse (201312220102), we get a palindrome (2211534351122).
The spelling of 2010222131020 in words is "two trillion, ten billion, two hundred twenty-two million, one hundred thirty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •