Base | Representation |
---|---|
bin | 101110101101011110… |
… | …1011011011001000111 |
3 | 100120220210112020010212 |
4 | 1131122331123121013 |
5 | 3120413414101411 |
6 | 114025405510035 |
7 | 10150532324621 |
oct | 1353275333107 |
9 | 316823466125 |
10 | 100310300231 |
11 | 395a5605279 |
12 | 1753587231b |
13 | 95c7ba594b |
14 | 4bd8355c11 |
15 | 29215d068b |
hex | 175af5b647 |
100310300231 has 8 divisors (see below), whose sum is σ = 100478381184. Its totient is φ = 100142269920.
The previous prime is 100310300227. The next prime is 100310300257. The reversal of 100310300231 is 132003013001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100310300231 - 22 = 100310300227 is a prime.
It is a super-2 number, since 2×1003103002312 (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 (100310300221) 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 7 ways as a sum of consecutive naturals, for example, 7798001 + ... + 7810853.
It is an arithmetic number, because the mean of its divisors is an integer number (12559797648).
Almost surely, 2100310300231 is an apocalyptic number.
100310300231 is a deficient number, since it is larger than the sum of its proper divisors (168080953).
100310300231 is a wasteful number, since it uses less digits than its factorization.
100310300231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25321.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 100310300231 its reverse (132003013001), we get a palindrome (232313313232).
The spelling of 100310300231 in words is "one hundred billion, three hundred ten million, three hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •