Base | Representation |
---|---|
bin | 1011000000010111101111… |
… | …0011101001110101100110 |
3 | 1120211211210111102021101200 |
4 | 2300011323303221311212 |
5 | 3041230322000323420 |
6 | 41423042254503330 |
7 | 2356161026646213 |
oct | 260057363516546 |
9 | 46754714367350 |
10 | 12101000011110 |
11 | 394600704106a |
12 | 1435308504b46 |
13 | 69a17244157a |
14 | 2db997790b0a |
15 | 15eb94d3eb90 |
hex | b017bce9d66 |
12101000011110 has 48 divisors (see below), whose sum is σ = 31496035530960. Its totient is φ = 3223504054080.
The previous prime is 12101000011109. The next prime is 12101000011123. The reversal of 12101000011110 is 1111000010121.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 12101000011092 and 12101000011101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 71358220 + ... + 71527599.
It is an arithmetic number, because the mean of its divisors is an integer number (656167406895).
Almost surely, 212101000011110 is an apocalyptic number.
12101000011110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12101000011110 is an abundant number, since it is smaller than the sum of its proper divisors (19395035519850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101000011110 is a wasteful number, since it uses less digits than its factorization.
12101000011110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142886773 (or 142886770 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 12101000011110 its reverse (1111000010121), we get a palindrome (13212000021231).
The spelling of 12101000011110 in words is "twelve trillion, one hundred one billion, eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •