Base | Representation |
---|---|
bin | 10110101111100000110110… |
… | …010110010111001011001001 |
3 | 111010011000112211121010112211 |
4 | 112233200312112113023021 |
5 | 101102230240204033001 |
6 | 552421304553305121 |
7 | 30032234064003043 |
oct | 2657406626271311 |
9 | 433130484533484 |
10 | 100022110221001 |
11 | 299631587154a1 |
12 | b274b564051a1 |
13 | 43a7076a79a57 |
14 | 1a9b14b484a93 |
15 | b86c10921351 |
hex | 5af8365972c9 |
100022110221001 has 8 divisors (see below), whose sum is σ = 105286619495520. Its totient is φ = 94757619714912.
The previous prime is 100022110220933. The next prime is 100022110221017. The reversal of 100022110221001 is 100122011220001.
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 100022110221001 - 239 = 99472354407113 is a prime.
It is a super-2 number, since 2×1000221102210012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100022110621001) 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, 6993141 + ... + 15778093.
It is an arithmetic number, because the mean of its divisors is an integer number (13160827436940).
Almost surely, 2100022110221001 is an apocalyptic number.
It is an amenable number.
100022110221001 is a deficient number, since it is larger than the sum of its proper divisors (5264509274519).
100022110221001 is an equidigital number, since it uses as much as digits as its factorization.
100022110221001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9384215.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100022110221001 its reverse (100122011220001), we get a palindrome (200144121441002).
The spelling of 100022110221001 in words is "one hundred trillion, twenty-two billion, one hundred ten million, two hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •