Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …000011111110111111010101 |
3 | 111010111101110222202200002121 |
4 | 112300330013003332333111 |
5 | 101110331431341401010 |
6 | 552534312310335541 |
7 | 30042303303632056 |
oct | 2660740703767725 |
9 | 433441428680077 |
10 | 100120101122005 |
11 | 299a0772a597a8 |
12 | b28bb4335a5b1 |
13 | 43b3392277703 |
14 | 1aa1ba575c72d |
15 | b8954859c3da |
hex | 5b0f070fefd5 |
100120101122005 has 8 divisors (see below), whose sum is σ = 124019738164224. Its totient is φ = 77512336352400.
The previous prime is 100120101121991. The next prime is 100120101122029. The reversal of 100120101122005 is 500221101021001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100120101122005 - 219 = 100120100597717 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100120101122005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 322968067981 + ... + 322968068290.
It is an arithmetic number, because the mean of its divisors is an integer number (15502467270528).
Almost surely, 2100120101122005 is an apocalyptic number.
It is an amenable number.
100120101122005 is a deficient number, since it is larger than the sum of its proper divisors (23899637042219).
100120101122005 is an equidigital number, since it uses as much as digits as its factorization.
100120101122005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 645936136307.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 100120101122005 its reverse (500221101021001), we get a palindrome (600341202143006).
The spelling of 100120101122005 in words is "one hundred trillion, one hundred twenty billion, one hundred one million, one hundred twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •