Base | Representation |
---|---|
bin | 101110100101001000… |
… | …0111110111111110011 |
3 | 100120012021111101020121 |
4 | 1131022100332333303 |
5 | 3114330213323011 |
6 | 113541522351111 |
7 | 10140561535231 |
oct | 1351220767763 |
9 | 316167441217 |
10 | 100030214131 |
11 | 394714a2461 |
12 | 17477abb497 |
13 | 9581b5b023 |
14 | 4bad087951 |
15 | 2906c06e71 |
hex | 174a43eff3 |
100030214131 has 32 divisors (see below), whose sum is σ = 110267136000. Its totient is φ = 90331338240.
The previous prime is 100030214117. The next prime is 100030214191. The reversal of 100030214131 is 131412030001.
It is a cyclic number.
It is not a de Polignac number, because 100030214131 - 27 = 100030214003 is a prime.
It is a super-2 number, since 2×1000302141312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100030214191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67450516 + ... + 67451998.
It is an arithmetic number, because the mean of its divisors is an integer number (3445848000).
Almost surely, 2100030214131 is an apocalyptic number.
100030214131 is a deficient number, since it is larger than the sum of its proper divisors (10236921869).
100030214131 is a wasteful number, since it uses less digits than its factorization.
100030214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2539.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100030214131 its reverse (131412030001), we get a palindrome (231442244132).
The spelling of 100030214131 in words is "one hundred billion, thirty million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •