Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0001110011001010011 |
3 | 110110011000210101121112 |
4 | 1321102120032121103 |
5 | 4113203130213021 |
6 | 135454412243535 |
7 | 12260151044144 |
oct | 1712230163123 |
9 | 413130711545 |
10 | 130231101011 |
11 | 5025a074800 |
12 | 212a61705ab |
13 | c385a2acab |
14 | 6436065acb |
15 | 35c32b2d5b |
hex | 1e5260e653 |
130231101011 has 6 divisors (see below), whose sum is σ = 143146582236. Its totient is φ = 118391909900.
The previous prime is 130231100981. The next prime is 130231101041. The reversal of 130231101011 is 110101132031.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (130231100981) and next prime (130231101041).
It is a de Polignac number, because none of the positive numbers 2k-130231101011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130231101041) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 538144925 + ... + 538145166.
It is an arithmetic number, because the mean of its divisors is an integer number (23857763706).
Almost surely, 2130231101011 is an apocalyptic number.
130231101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130231101011 is a deficient number, since it is larger than the sum of its proper divisors (12915481225).
130231101011 is a wasteful number, since it uses less digits than its factorization.
130231101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1076290113 (or 1076290102 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 130231101011 its reverse (110101132031), we get a palindrome (240332233042).
The spelling of 130231101011 in words is "one hundred thirty billion, two hundred thirty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •