Base | Representation |
---|---|
bin | 1001010010011011000111… |
… | …1011000001111110011010 |
3 | 1100011021021100202210210012 |
4 | 2110212301323001332122 |
5 | 2314303411302220120 |
6 | 33415214554121522 |
7 | 2102541624234545 |
oct | 224466173017632 |
9 | 40137240683705 |
10 | 10212122304410 |
11 | 3287a338a1a14 |
12 | 118b2171202a2 |
13 | 590ccaa61c90 |
14 | 2743ab18785c |
15 | 12a9927461c5 |
hex | 949b1ec1f9a |
10212122304410 has 64 divisors (see below), whose sum is σ = 20991413090592. Its totient is φ = 3543554359296.
The previous prime is 10212122304403. The next prime is 10212122304413. The reversal of 10212122304410 is 1440322121201.
It can be written as a sum of positive squares in 16 ways, for example, as 1435757529361 + 8776364775049 = 1198231^2 + 2962493^2 .
It is not an unprimeable number, because it can be changed into a prime (10212122304413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1945709 + ... + 4920368.
Almost surely, 210212122304410 is an apocalyptic number.
10212122304410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10212122304410 is an abundant number, since it is smaller than the sum of its proper divisors (10779290786182).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212122304410 is a wasteful number, since it uses less digits than its factorization.
10212122304410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6866787.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 10212122304410 its reverse (1440322121201), we get a palindrome (11652444425611).
The spelling of 10212122304410 in words is "ten trillion, two hundred twelve billion, one hundred twenty-two million, three hundred four thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •