Base | Representation |
---|---|
bin | 1010111011101011010100… |
… | …0001011111101000010001 |
3 | 1120120010122020122210102012 |
4 | 2232322311001133220101 |
5 | 3033420142010441001 |
6 | 41322024120232305 |
7 | 2350304421310223 |
oct | 256726501375021 |
9 | 46503566583365 |
10 | 12020355562001 |
11 | 3914893387916 |
12 | 142176090b695 |
13 | 69268c94a227 |
14 | 2d7b071bc413 |
15 | 15ca24ec32bb |
hex | aeeb505fa11 |
12020355562001 has 8 divisors (see below), whose sum is σ = 12200239814400. Its totient is φ = 11841164506080.
The previous prime is 12020355561989. The next prime is 12020355562021. The reversal of 12020355562001 is 10026555302021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12020355562001 is a prime.
It is a super-3 number, since 3×120203555620013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12020355562021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 173264180 + ... + 173333541.
It is an arithmetic number, because the mean of its divisors is an integer number (1525029976800).
Almost surely, 212020355562001 is an apocalyptic number.
It is an amenable number.
12020355562001 is a deficient number, since it is larger than the sum of its proper divisors (179884252399).
12020355562001 is an equidigital number, since it uses as much as digits as its factorization.
12020355562001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346598239.
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 12020355562001 in words is "twelve trillion, twenty billion, three hundred fifty-five million, five hundred sixty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •