Base | Representation |
---|---|
bin | 1001010010010011101010… |
… | …1001100000000010010000 |
3 | 1100011002002220101012100200 |
4 | 2110210322221200002100 |
5 | 2314240312013021430 |
6 | 33414244232015200 |
7 | 2102441215266114 |
oct | 224447251400220 |
9 | 40132086335320 |
10 | 10210121220240 |
11 | 32870a7284847 |
12 | 118a958b31500 |
13 | 590a6c2c82c6 |
14 | 27425b4c9744 |
15 | 12a8c6c1c460 |
hex | 9493aa60090 |
10210121220240 has 120 divisors (see below), whose sum is σ = 35395086974208. Its totient is φ = 2634869986560.
The previous prime is 10210121220239. The next prime is 10210121220251. The reversal of 10210121220240 is 4202212101201.
10210121220240 is a `hidden beast` number, since 1 + 0 + 210 + 1 + 212 + 2 + 0 + 240 = 666.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 228699034 + ... + 228743673.
Almost surely, 210210121220240 is an apocalyptic number.
10210121220240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10210121220240 is an abundant number, since it is smaller than the sum of its proper divisors (25184965753968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210121220240 is a wasteful number, since it uses less digits than its factorization.
10210121220240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457442757 (or 457442748 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 10210121220240 its reverse (4202212101201), we get a palindrome (14412333321441).
The spelling of 10210121220240 in words is "ten trillion, two hundred ten billion, one hundred twenty-one million, two hundred twenty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •