Base | Representation |
---|---|
bin | 1001000111110101000010… |
… | …0011011101111101111111 |
3 | 1022111212102220220022222212 |
4 | 2101331100203131331333 |
5 | 2303313121112024411 |
6 | 33155433034531035 |
7 | 2053436142150524 |
oct | 221752043357577 |
9 | 38455386808885 |
10 | 10030100111231 |
11 | 3217818035102 |
12 | 115ba98296a7b |
13 | 579ab01a2925 |
14 | 26966099714b |
15 | 125d8c74468b |
hex | 91f508ddf7f |
10030100111231 has 4 divisors (see below), whose sum is σ = 10118862059232. Its totient is φ = 9941338163232.
The previous prime is 10030100111197. The next prime is 10030100111263. The reversal of 10030100111231 is 13211100103001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10030100111231 is a prime.
It is a super-2 number, since 2×100301001112312 (a number of 27 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 (10030100111831) 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, 44380973831 + ... + 44380974056.
It is an arithmetic number, because the mean of its divisors is an integer number (2529715514808).
Almost surely, 210030100111231 is an apocalyptic number.
10030100111231 is a deficient number, since it is larger than the sum of its proper divisors (88761948001).
10030100111231 is an equidigital number, since it uses as much as digits as its factorization.
10030100111231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88761948000.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 10030100111231 its reverse (13211100103001), we get a palindrome (23241200214232).
The spelling of 10030100111231 in words is "ten trillion, thirty billion, one hundred million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •