Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010111011111101111011111 |
3 | 111010002000101010222021010022 |
4 | 112233031103113133233133 |
5 | 101101404244242033043 |
6 | 552403514211502355 |
7 | 30030562013644532 |
oct | 2657152327375737 |
9 | 433060333867108 |
10 | 100001122221023 |
11 | 29955268519471 |
12 | b270a795b79bb |
13 | 43a50b07a6c5a |
14 | 1a9a119c96a19 |
15 | b863d3094868 |
hex | 5af3535dfbdf |
100001122221023 has 4 divisors (see below), whose sum is σ = 100001360311320. Its totient is φ = 100000884130728.
The previous prime is 100001122220939. The next prime is 100001122221029. The reversal of 100001122221023 is 320122221100001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100001122221023 - 28 = 100001122220767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001122220992 and 100001122221010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001122221029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 118414013 + ... + 119255526.
It is an arithmetic number, because the mean of its divisors is an integer number (25000340077830).
Almost surely, 2100001122221023 is an apocalyptic number.
100001122221023 is a deficient number, since it is larger than the sum of its proper divisors (238090297).
100001122221023 is an equidigital number, since it uses as much as digits as its factorization.
100001122221023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238090296.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 100001122221023 its reverse (320122221100001), we get a palindrome (420123343321024).
The spelling of 100001122221023 in words is "one hundred trillion, one billion, one hundred twenty-two million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •