Base | Representation |
---|---|
bin | 1011000001100110010101… |
… | …1110001001011010011001 |
3 | 1120220212020222222101222211 |
4 | 2300121211132021122121 |
5 | 3042102030112023001 |
6 | 41440452123115121 |
7 | 2360535640563346 |
oct | 260314536113231 |
9 | 46825228871884 |
10 | 12122100111001 |
11 | 3953a54543451 |
12 | 1439416972aa1 |
13 | 69c155a0348a |
14 | 2dc9d9bdd7cd |
15 | 1604cc461351 |
hex | b0665789699 |
12122100111001 has 8 divisors (see below), whose sum is σ = 12519934742304. Its totient is φ = 11729534812800.
The previous prime is 12122100110959. The next prime is 12122100111013. The reversal of 12122100111001 is 10011100122121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12122100111001 - 27 = 12122100110873 is a prime.
It is a super-2 number, since 2×121221001110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12122100111041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1317328600 + ... + 1317337801.
It is an arithmetic number, because the mean of its divisors is an integer number (1564991842788).
Almost surely, 212122100111001 is an apocalyptic number.
It is an amenable number.
12122100111001 is a deficient number, since it is larger than the sum of its proper divisors (397834631303).
12122100111001 is a wasteful number, since it uses less digits than its factorization.
12122100111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2634666551.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12122100111001 its reverse (10011100122121), we get a palindrome (22133200233122).
The spelling of 12122100111001 in words is "twelve trillion, one hundred twenty-two billion, one hundred million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •