Base | Representation |
---|---|
bin | 1001000110110010011001… |
… | …1110100110011110100110 |
3 | 1022110011021102122011012210 |
4 | 2101230212132212132212 |
5 | 2303020003331314420 |
6 | 33143314152224250 |
7 | 2052234001361616 |
oct | 221544636463646 |
9 | 38404242564183 |
10 | 10012214323110 |
11 | 3210179a7082a |
12 | 115852639b086 |
13 | 5781bc82084c |
14 | 2688453baa46 |
15 | 1256923eb9e0 |
hex | 91b267a67a6 |
10012214323110 has 16 divisors (see below), whose sum is σ = 24029314375536. Its totient is φ = 2669923819488.
The previous prime is 10012214323109. The next prime is 10012214323141. The reversal of 10012214323110 is 1132341221001.
It is a super-3 number, since 3×100122143231103 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 166870238689 + ... + 166870238748.
It is an arithmetic number, because the mean of its divisors is an integer number (1501832148471).
Almost surely, 210012214323110 is an apocalyptic number.
10012214323110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10012214323110 is an abundant number, since it is smaller than the sum of its proper divisors (14017100052426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012214323110 is a wasteful number, since it uses less digits than its factorization.
10012214323110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333740477447.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10012214323110 its reverse (1132341221001), we get a palindrome (11144555544111).
The spelling of 10012214323110 in words is "ten trillion, twelve billion, two hundred fourteen million, three hundred twenty-three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •