Base | Representation |
---|---|
bin | 101110100111001110… |
… | …0000010110111011111 |
3 | 100120101011020011120121 |
4 | 1131032130002313133 |
5 | 3120001124104211 |
6 | 113552503055411 |
7 | 10142401565116 |
oct | 1351634026737 |
9 | 316334204517 |
10 | 100100222431 |
11 | 394a7a69760 |
12 | 17497441567 |
13 | 9593500561 |
14 | 4bb84acc7d |
15 | 290ce35271 |
hex | 174e702ddf |
100100222431 has 4 divisors (see below), whose sum is σ = 109200242664. Its totient is φ = 91000202200.
The previous prime is 100100222381. The next prime is 100100222507. The reversal of 100100222431 is 134222001001.
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 100100222431 - 27 = 100100222303 is a prime.
It is a super-2 number, since 2×1001002224312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100100225431) 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, 4550010100 + ... + 4550010121.
It is an arithmetic number, because the mean of its divisors is an integer number (27300060666).
Almost surely, 2100100222431 is an apocalyptic number.
100100222431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100100222431 is a deficient number, since it is larger than the sum of its proper divisors (9100020233).
100100222431 is an equidigital number, since it uses as much as digits as its factorization.
100100222431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9100020232.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 100100222431 its reverse (134222001001), we get a palindrome (234322223432).
The spelling of 100100222431 in words is "one hundred billion, one hundred million, two hundred twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •