Base | Representation |
---|---|
bin | 101110100111100001… |
… | …0001110001000001110 |
3 | 100120101212001121102102 |
4 | 1131033002032020032 |
5 | 3120011204330110 |
6 | 113553501355102 |
7 | 10142552625566 |
oct | 1351702161016 |
9 | 316355047372 |
10 | 100110230030 |
11 | 395026845a8 |
12 | 1749a868a92 |
13 | 95955c5705 |
14 | 4bb9955da6 |
15 | 290dc605a5 |
hex | 174f08e20e |
100110230030 has 16 divisors (see below), whose sum is σ = 181141864704. Its totient is φ = 39834436320.
The previous prime is 100110230021. The next prime is 100110230039. The reversal of 100110230030 is 30032011001.
It is an interprime number because it is at equal distance from previous prime (100110230021) and next prime (100110230039).
It is a junction number, because it is equal to n+sod(n) for n = 100110229993 and 100110230020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110230039) 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 7 ways as a sum of consecutive naturals, for example, 26204957 + ... + 26208776.
It is an arithmetic number, because the mean of its divisors is an integer number (11321366544).
Almost surely, 2100110230030 is an apocalyptic number.
100110230030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100110230030 is a deficient number, since it is larger than the sum of its proper divisors (81031634674).
100110230030 is a wasteful number, since it uses less digits than its factorization.
100110230030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52413931.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 100110230030 its reverse (30032011001), we get a palindrome (130142241031).
The spelling of 100110230030 in words is "one hundred billion, one hundred ten million, two hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •