Base | Representation |
---|---|
bin | 110011001110010110… |
… | …0001100011000001011 |
3 | 101111221022002001121112 |
4 | 1212130230030120023 |
5 | 3300241232410011 |
6 | 122311254200535 |
7 | 10642656120044 |
oct | 1463454143013 |
9 | 344838061545 |
10 | 110003013131 |
11 | 42719918a00 |
12 | 1939b95314b |
13 | a4b101351b |
14 | 54777698cb |
15 | 2cdc4e058b |
hex | 199cb0c60b |
110003013131 has 6 divisors (see below), whose sum is σ = 120912402996. Its totient is φ = 100002739100.
The previous prime is 110003013103. The next prime is 110003013137. The reversal of 110003013131 is 131310300011.
It is a happy number.
It is not a de Polignac number, because 110003013131 - 234 = 92823143947 is a prime.
It is a super-2 number, since 2×1100030131312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110003013137) 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 5 ways as a sum of consecutive naturals, for example, 454557785 + ... + 454558026.
It is an arithmetic number, because the mean of its divisors is an integer number (20152067166).
Almost surely, 2110003013131 is an apocalyptic number.
110003013131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110003013131 is a deficient number, since it is larger than the sum of its proper divisors (10909389865).
110003013131 is an equidigital number, since it uses as much as digits as its factorization.
110003013131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 909115833 (or 909115822 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 110003013131 its reverse (131310300011), we get a palindrome (241313313142).
The spelling of 110003013131 in words is "one hundred ten billion, three million, thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •