Base | Representation |
---|---|
bin | 101110100111100101… |
… | …0001000000010010111 |
3 | 100120101222221212221121 |
4 | 1131033022020002113 |
5 | 3120012222132411 |
6 | 113554014024411 |
7 | 10142606346154 |
oct | 1351712100227 |
9 | 316358855847 |
10 | 100112302231 |
11 | 3950386a467 |
12 | 1749b4a8107 |
13 | 9595b6c976 |
14 | 4bb9d3522b |
15 | 290e01e571 |
hex | 174f288097 |
100112302231 has 4 divisors (see below), whose sum is σ = 100201450552. Its totient is φ = 100023153912.
The previous prime is 100112302223. The next prime is 100112302291. The reversal of 100112302231 is 132203211001.
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 100112302231 - 23 = 100112302223 is a prime.
It is a super-2 number, since 2×1001123022312 (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 (100112302291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44572476 + ... + 44574721.
It is an arithmetic number, because the mean of its divisors is an integer number (25050362638).
Almost surely, 2100112302231 is an apocalyptic number.
100112302231 is a deficient number, since it is larger than the sum of its proper divisors (89148321).
100112302231 is an equidigital number, since it uses as much as digits as its factorization.
100112302231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89148320.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100112302231 its reverse (132203211001), we get a palindrome (232315513232).
The spelling of 100112302231 in words is "one hundred billion, one hundred twelve million, three hundred two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •