Base | Representation |
---|---|
bin | 1010000000010101111100… |
… | …01111000110110001010001 |
3 | 2212220101001012020022021102 |
4 | 11000022332033012301101 |
5 | 10340440111103333131 |
6 | 114443330304434145 |
7 | 4430410264203653 |
oct | 500127617066121 |
9 | 85811035208242 |
10 | 22002014121041 |
11 | 701300241a869 |
12 | 257417a018955 |
13 | c37a1cbc79b6 |
14 | 560c904006d3 |
15 | 2824c9ab51cb |
hex | 1402be3c6c51 |
22002014121041 has 8 divisors (see below), whose sum is σ = 22012732894824. Its totient is φ = 21991295764480.
The previous prime is 22002014121023. The next prime is 22002014121067. The reversal of 22002014121041 is 14012141020022.
It can be written as a sum of positive squares in 4 ways, for example, as 13869136808641 + 8132877312400 = 3724129^2 + 2851820^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 22002014121041 - 210 = 22002014120017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22002014126041) 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, 179176721 + ... + 179299473.
It is an arithmetic number, because the mean of its divisors is an integer number (2751591611853).
Almost surely, 222002014121041 is an apocalyptic number.
It is an amenable number.
22002014121041 is a deficient number, since it is larger than the sum of its proper divisors (10718773783).
22002014121041 is a wasteful number, since it uses less digits than its factorization.
22002014121041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208611.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 22002014121041 its reverse (14012141020022), we get a palindrome (36014155141063).
The spelling of 22002014121041 in words is "twenty-two trillion, two billion, fourteen million, one hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •