Base | Representation |
---|---|
bin | 1010111011001000110101… |
… | …0110110000000010101101 |
3 | 1120112020202012220011112110 |
4 | 2232302031112300002231 |
5 | 3033242213112023041 |
6 | 41313453451554233 |
7 | 2346526154262144 |
oct | 256621526600255 |
9 | 46466665804473 |
10 | 12011100111021 |
11 | 391097397a580 |
12 | 141b9b915b979 |
13 | 69184629940b |
14 | 2d74a9cac75b |
15 | 15c682687516 |
hex | aec8d5b00ad |
12011100111021 has 32 divisors (see below), whose sum is σ = 18091152654336. Its totient is φ = 7022410488000.
The previous prime is 12011100111019. The next prime is 12011100111091.
12011100111021 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 12011100111021 - 21 = 12011100111019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011100110988 and 12011100111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011100111091) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18194725 + ... + 18843306.
It is an arithmetic number, because the mean of its divisors is an integer number (565348520448).
Almost surely, 212011100111021 is an apocalyptic number.
12011100111021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12011100111021 is a deficient number, since it is larger than the sum of its proper divisors (6080052543315).
12011100111021 is a wasteful number, since it uses less digits than its factorization.
12011100111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37038393.
The product of its (nonzero) digits is 4, while the sum is 12.
It can be divided in two parts, 12011100 and 111021, that added together give a palindrome (12122121).
The spelling of 12011100111021 in words is "twelve trillion, eleven billion, one hundred million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •