Base | Representation |
---|---|
bin | 1001010010011011011110… |
… | …0010100001100100101011 |
3 | 1100011021111221002122120000 |
4 | 2110212313202201210223 |
5 | 2314304104413343111 |
6 | 33415232202034043 |
7 | 2102544150244302 |
oct | 224466742414453 |
9 | 40137457078500 |
10 | 10212216543531 |
11 | 3287a82009192 |
12 | 118b2427a8923 |
13 | 591014439582 |
14 | 2743b98b9439 |
15 | 12a99ab5dc56 |
hex | 949b78a192b |
10212216543531 has 40 divisors (see below), whose sum is σ = 15420031260480. Its totient is φ = 6734689961472.
The previous prime is 10212216543511. The next prime is 10212216543539. The reversal of 10212216543531 is 13534561221201.
10212216543531 is a `hidden beast` number, since 1 + 0 + 2 + 1 + 2 + 21 + 65 + 43 + 531 = 666.
It is not a de Polignac number, because 10212216543531 - 26 = 10212216543467 is a prime.
It is a super-2 number, since 2×102122165435312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10212216543539) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15942030 + ... + 16570236.
It is an arithmetic number, because the mean of its divisors is an integer number (385500781512).
Almost surely, 210212216543531 is an apocalyptic number.
10212216543531 is a deficient number, since it is larger than the sum of its proper divisors (5207814716949).
10212216543531 is an equidigital number, since it uses as much as digits as its factorization.
10212216543531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630385 (or 630376 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 10212216543531 its reverse (13534561221201), we get a palindrome (23746777764732).
The spelling of 10212216543531 in words is "ten trillion, two hundred twelve billion, two hundred sixteen million, five hundred forty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •