Base | Representation |
---|---|
bin | 10110101111100000110101… |
… | …110011010001010110101001 |
3 | 111010011000112012021210001120 |
4 | 112233200311303101112221 |
5 | 101102230230330201441 |
6 | 552421304024205453 |
7 | 30032233622551125 |
oct | 2657406563212651 |
9 | 433130465253046 |
10 | 100022101022121 |
11 | 29963153502213 |
12 | b274b53309889 |
13 | 43a7074ba8a25 |
14 | 1a9b14a16c585 |
15 | b86c0ec05966 |
hex | 5af835cd15a9 |
100022101022121 has 8 divisors (see below), whose sum is σ = 133679577614784. Its totient is φ = 66523012555440.
The previous prime is 100022101022099. The next prime is 100022101022131. The reversal of 100022101022121 is 121220101220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100022101022121 - 211 = 100022101020073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100022101022121.
It is not an unprimeable number, because it can be changed into a prime (100022101022131) 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, 39597030021 + ... + 39597032546.
It is an arithmetic number, because the mean of its divisors is an integer number (16709947201848).
Almost surely, 2100022101022121 is an apocalyptic number.
It is an amenable number.
100022101022121 is a deficient number, since it is larger than the sum of its proper divisors (33657476592663).
100022101022121 is an equidigital number, since it uses as much as digits as its factorization.
100022101022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79194062991.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100022101022121 its reverse (121220101220001), we get a palindrome (221242202242122).
The spelling of 100022101022121 in words is "one hundred trillion, twenty-two billion, one hundred one million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •