Base | Representation |
---|---|
bin | 1001010010010011001101… |
… | …1111101010010001010100 |
3 | 1100011001210112112112211110 |
4 | 2110210303133222101110 |
5 | 2314240040301401322 |
6 | 33414224303335020 |
7 | 2102435230162362 |
oct | 224446337522124 |
9 | 40131715475743 |
10 | 10210001200212 |
11 | 3287045559a40 |
12 | 118a9248b1470 |
13 | 590a50495238 |
14 | 2742495a6632 |
15 | 12a8bb410c0c |
hex | 949337ea454 |
10210001200212 has 48 divisors (see below), whose sum is σ = 26163517464000. Its totient is φ = 3073175055360.
The previous prime is 10210001200177. The next prime is 10210001200213. The reversal of 10210001200212 is 21200210001201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210001200213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 259539037 + ... + 259578372.
It is an arithmetic number, because the mean of its divisors is an integer number (545073280500).
Almost surely, 210210001200212 is an apocalyptic number.
10210001200212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10210001200212 is an abundant number, since it is smaller than the sum of its proper divisors (15953516263788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210001200212 is a wasteful number, since it uses less digits than its factorization.
10210001200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519117576 (or 519117574 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10210001200212 its reverse (21200210001201), we get a palindrome (31410211201413).
The spelling of 10210001200212 in words is "ten trillion, two hundred ten billion, one million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •