Base | Representation |
---|---|
bin | 10001100111000110001… |
… | …001001111100100011100 |
3 | 11021200202121212001022120 |
4 | 101213012021033210130 |
5 | 124312002242401022 |
6 | 2323543550542540 |
7 | 153302064210423 |
oct | 21470611174434 |
9 | 4250677761276 |
10 | 1210210122012 |
11 | 42727a077961 |
12 | 176668b07a50 |
13 | 8a178994718 |
14 | 428085462ba |
15 | 21731251d5c |
hex | 119c624f91c |
1210210122012 has 48 divisors (see below), whose sum is σ = 2900440983552. Its totient is φ = 392460275520.
The previous prime is 1210210121941. The next prime is 1210210122029. The reversal of 1210210122012 is 2102210120121.
It is a junction number, because it is equal to n+sod(n) for n = 1210210121982 and 1210210122000.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4350837 + ... + 4620627.
It is an arithmetic number, because the mean of its divisors is an integer number (60425853824).
Almost surely, 21210210122012 is an apocalyptic number.
1210210122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1210210122012 is an abundant number, since it is smaller than the sum of its proper divisors (1690230861540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210210122012 is a wasteful number, since it uses less digits than its factorization.
1210210122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279938 (or 279936 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1210210122012 its reverse (2102210120121), we get a palindrome (3312420242133).
The spelling of 1210210122012 in words is "one trillion, two hundred ten billion, two hundred ten million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •