Base | Representation |
---|---|
bin | 1011000000010100000101… |
… | …1101011111000001010110 |
3 | 1120211202021021110111202111 |
4 | 2300011001131133001112 |
5 | 3041221320401333420 |
6 | 41422401205501234 |
7 | 2356124542346416 |
oct | 260050135370126 |
9 | 46752237414674 |
10 | 12100021121110 |
11 | 394565452656a |
12 | 143509471181a |
13 | 69a0476b5b10 |
14 | 2db90377a646 |
15 | 15eb38e2d45a |
hex | b014175f056 |
12100021121110 has 16 divisors (see below), whose sum is σ = 23455425558096. Its totient is φ = 4467700106208.
The previous prime is 12100021121099. The next prime is 12100021121141. The reversal of 12100021121110 is 1112112000121.
It is a happy number.
It is a super-2 number, since 2×121000211211102 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46538542644 + ... + 46538542903.
It is an arithmetic number, because the mean of its divisors is an integer number (1465964097381).
Almost surely, 212100021121110 is an apocalyptic number.
12100021121110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12100021121110 is a deficient number, since it is larger than the sum of its proper divisors (11355404436986).
12100021121110 is a wasteful number, since it uses less digits than its factorization.
12100021121110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93077085567.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12100021121110 its reverse (1112112000121), we get a palindrome (13212133121231).
The spelling of 12100021121110 in words is "twelve trillion, one hundred billion, twenty-one million, one hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •