Base | Representation |
---|---|
bin | 1011000001000001000101… |
… | …1011001000011110100001 |
3 | 1120212220110002012012210001 |
4 | 2300100101123020132201 |
5 | 3041421040111200001 |
6 | 41432115540140001 |
7 | 2360033063104336 |
oct | 260202133103641 |
9 | 46786402165701 |
10 | 12112100100001 |
11 | 394a792821150 |
12 | 14374a5997601 |
13 | 69b221010cc5 |
14 | 2dc32ba7698d |
15 | 1600e45a0001 |
hex | b04116c87a1 |
12112100100001 has 16 divisors (see below), whose sum is σ = 13275159333120. Its totient is φ = 10959394830480.
The previous prime is 12112100099963. The next prime is 12112100100017. The reversal of 12112100100001 is 10000100121121.
It is a cyclic number.
It is not a de Polignac number, because 12112100100001 - 243 = 3316007077793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12112100101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8173090 + ... + 9540628.
It is an arithmetic number, because the mean of its divisors is an integer number (829697458320).
Almost surely, 212112100100001 is an apocalyptic number.
12112100100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12112100100001 is a deficient number, since it is larger than the sum of its proper divisors (1163059233119).
12112100100001 is a wasteful number, since it uses less digits than its factorization.
12112100100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1371324.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12112100100001 its reverse (10000100121121), we get a palindrome (22112200221122).
The spelling of 12112100100001 in words is "twelve trillion, one hundred twelve billion, one hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •