Base | Representation |
---|---|
bin | 1001010010011010101101… |
… | …0111000110001001011100 |
3 | 1100011020222200121222202121 |
4 | 2110212223113012021130 |
5 | 2314303200112033040 |
6 | 33415200022432324 |
7 | 2102536116444661 |
oct | 224465327061134 |
9 | 40136880558677 |
10 | 10212012221020 |
11 | 3287987743705 |
12 | 118b1a62926a4 |
13 | 590cb0cca98c |
14 | 27439a6cda68 |
15 | 12a987c4dc4a |
hex | 949ab5c625c |
10212012221020 has 12 divisors (see below), whose sum is σ = 21445225664184. Its totient is φ = 4084804888400.
The previous prime is 10212012221011. The next prime is 10212012221107. The reversal of 10212012221020 is 2012221021201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10212012220985 and 10212012221003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 255300305506 + ... + 255300305545.
It is an arithmetic number, because the mean of its divisors is an integer number (1787102138682).
Almost surely, 210212012221020 is an apocalyptic number.
10212012221020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10212012221020 is an abundant number, since it is smaller than the sum of its proper divisors (11233213443164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212012221020 is a wasteful number, since it uses less digits than its factorization.
10212012221020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510600611060 (or 510600611058 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10212012221020 its reverse (2012221021201), we get a palindrome (12224233242221).
The spelling of 10212012221020 in words is "ten trillion, two hundred twelve billion, twelve million, two hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •