Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …101011110000101010111110 |
3 | 111010002212121020002221110211 |
4 | 112233111223223300222332 |
5 | 101102031211222333042 |
6 | 552412003120023034 |
7 | 30031331002561246 |
oct | 2657255353605276 |
9 | 433085536087424 |
10 | 100010120121022 |
11 | 29959065605961 |
12 | b27276aa61a7a |
13 | 43a5bb59a0437 |
14 | 1a9a730cc2b26 |
15 | b8675cea9017 |
hex | 5af56baf0abe |
100010120121022 has 4 divisors (see below), whose sum is σ = 150015180181536. Its totient is φ = 50005060060510.
The previous prime is 100010120120971. The next prime is 100010120121103. The reversal of 100010120121022 is 220121021010001.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 100010120120993 and 100010120121011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25002530030254 + ... + 25002530030257.
It is an arithmetic number, because the mean of its divisors is an integer number (37503795045384).
Almost surely, 2100010120121022 is an apocalyptic number.
100010120121022 is a deficient number, since it is larger than the sum of its proper divisors (50005060060514).
100010120121022 is an equidigital number, since it uses as much as digits as its factorization.
100010120121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50005060060513.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100010120121022 its reverse (220121021010001), we get a palindrome (320131141131023).
The spelling of 100010120121022 in words is "one hundred trillion, ten billion, one hundred twenty million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •