Base | Representation |
---|---|
bin | 1011000000111101000100… |
… | …0010111000011011101001 |
3 | 1120212210122210210111111101 |
4 | 2300033101002320123221 |
5 | 3041411332110013001 |
6 | 41431420434001401 |
7 | 2356664236315555 |
oct | 260172102703351 |
9 | 46783583714441 |
10 | 12111020001001 |
11 | 394a289069849 |
12 | 1437244116261 |
13 | 69b0ab30a67c |
14 | 2dc268438865 |
15 | 16007e84aa01 |
hex | b03d10b86e9 |
12111020001001 has 8 divisors (see below), whose sum is σ = 12170195823240. Its totient is φ = 12051987985152.
The previous prime is 12111020000987. The next prime is 12111020001007. The reversal of 12111020001001 is 10010002011121.
It can be written as a sum of positive squares in 4 ways, for example, as 1322580501225 + 10788439499776 = 1150035^2 + 3284576^2 .
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 12111020001001 - 27 = 12111020000873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111020001007) 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, 35782750 + ... + 36119623.
It is an arithmetic number, because the mean of its divisors is an integer number (1521274477905).
Almost surely, 212111020001001 is an apocalyptic number.
It is an amenable number.
12111020001001 is a deficient number, since it is larger than the sum of its proper divisors (59175822239).
12111020001001 is an equidigital number, since it uses as much as digits as its factorization.
12111020001001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71903195.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12111020001001 its reverse (10010002011121), we get a palindrome (22121022012122).
The spelling of 12111020001001 in words is "twelve trillion, one hundred eleven billion, twenty million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •