Base | Representation |
---|---|
bin | 1001001110010010111101… |
… | …0110011101010001111110 |
3 | 1022220111020111220101021000 |
4 | 2103210233112131101332 |
5 | 2312123200310431420 |
6 | 33322450352351130 |
7 | 2064451456302453 |
oct | 223445726352176 |
9 | 38814214811230 |
10 | 10141212202110 |
11 | 325a9559a8590 |
12 | 11795275454a6 |
13 | 587409bc4972 |
14 | 270ba174582a |
15 | 128be22b0690 |
hex | 9392f59d47e |
10141212202110 has 128 divisors (see below), whose sum is σ = 29503042905600. Its totient is φ = 2458364463360.
The previous prime is 10141212202109. The next prime is 10141212202127. The reversal of 10141212202110 is 1120221214101.
10141212202110 is a `hidden beast` number, since 1 + 0 + 1 + 412 + 1 + 220 + 21 + 10 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 79321257 + ... + 79449003.
It is an arithmetic number, because the mean of its divisors is an integer number (230492522700).
Almost surely, 210141212202110 is an apocalyptic number.
10141212202110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10141212202110 is an abundant number, since it is smaller than the sum of its proper divisors (19361830703490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141212202110 is a wasteful number, since it uses less digits than its factorization.
10141212202110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154503 (or 154497 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 10141212202110 its reverse (1120221214101), we get a palindrome (11261433416211).
The spelling of 10141212202110 in words is "ten trillion, one hundred forty-one billion, two hundred twelve million, two hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •