Base | Representation |
---|---|
bin | 1001010010010011010000… |
… | …0010000100010111101100 |
3 | 1100011001211011111210200010 |
4 | 2110210310002010113230 |
5 | 2314240100104020022 |
6 | 33414225224533220 |
7 | 2102435366640231 |
oct | 224446402042754 |
9 | 40131734453603 |
10 | 10210010220012 |
11 | 328704a65a719 |
12 | 118a927921210 |
13 | 590a523028b5 |
14 | 27424a873788 |
15 | 12a8bc0e350c |
hex | 949340845ec |
10210010220012 has 96 divisors (see below), whose sum is σ = 25101214163200. Its totient is φ = 3221130240000.
The previous prime is 10210010219989. The next prime is 10210010220023. The reversal of 10210010220012 is 21002201001201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 10210010220012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1971422439 + ... + 1971427617.
Almost surely, 210210010220012 is an apocalyptic number.
10210010220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10210010220012 is an abundant number, since it is smaller than the sum of its proper divisors (14891203943188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210010220012 is a wasteful number, since it uses less digits than its factorization.
10210010220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11807 (or 11805 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10210010220012 its reverse (21002201001201), we get a palindrome (31212211221213).
The spelling of 10210010220012 in words is "ten trillion, two hundred ten billion, ten million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •