Base | Representation |
---|---|
bin | 1011000001011110111101… |
… | …1100101101000000001001 |
3 | 1120220200011000002102011011 |
4 | 2300113233130231000021 |
5 | 3042034001211133001 |
6 | 41435523431003521 |
7 | 2360435605234246 |
oct | 260275734550011 |
9 | 46820130072134 |
10 | 12120120021001 |
11 | 3953128865533 |
12 | 1438b638095a1 |
13 | 69bbcb70a5a5 |
14 | 2dc88cc485cd |
15 | 1604136d2d51 |
hex | b05ef72d009 |
12120120021001 has 8 divisors (see below), whose sum is σ = 12128506643144. Its totient is φ = 12111735081600.
The previous prime is 12120120020903. The next prime is 12120120021103. The reversal of 12120120021001 is 10012002102121.
It can be written as a sum of positive squares in 4 ways, for example, as 4001296104976 + 8118823916025 = 2000324^2 + 2849355^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 12120120021001 - 27 = 12120120020873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12120120025001) 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, 14164051 + ... + 14995351.
It is an arithmetic number, because the mean of its divisors is an integer number (1516063330393).
Almost surely, 212120120021001 is an apocalyptic number.
It is an amenable number.
12120120021001 is a deficient number, since it is larger than the sum of its proper divisors (8386622143).
12120120021001 is an equidigital number, since it uses as much as digits as its factorization.
12120120021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841371.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12120120021001 its reverse (10012002102121), we get a palindrome (22132122123122).
The spelling of 12120120021001 in words is "twelve trillion, one hundred twenty billion, one hundred twenty million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •