Base | Representation |
---|---|
bin | 10100111011000100011111… |
… | …111111101111101101101001 |
3 | 110001211001020201201110020111 |
4 | 110323010133333233231221 |
5 | 44030124343021333001 |
6 | 523413300145054321 |
7 | 25245145420623022 |
oct | 2473043777575551 |
9 | 401731221643214 |
10 | 92020211121001 |
11 | 27358609241329 |
12 | a3a21726273a1 |
13 | 3c466128a88a7 |
14 | 18a1b328d3c49 |
15 | a989cbdc9851 |
hex | 53b11ffefb69 |
92020211121001 has 8 divisors (see below), whose sum is σ = 97522799662080. Its totient is φ = 86527582018368.
The previous prime is 92020211120983. The next prime is 92020211121017. The reversal of 92020211121001 is 10012111202029.
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 92020211121001 - 229 = 92019674250089 is a prime.
It is a super-2 number, since 2×920202111210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (92020211121101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2489840581 + ... + 2489877538.
It is an arithmetic number, because the mean of its divisors is an integer number (12190349957760).
Almost surely, 292020211121001 is an apocalyptic number.
It is an amenable number.
92020211121001 is a deficient number, since it is larger than the sum of its proper divisors (5502588541079).
92020211121001 is a wasteful number, since it uses less digits than its factorization.
92020211121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4979719223.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 92020211121001 in words is "ninety-two trillion, twenty billion, two hundred eleven million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •