Base | Representation |
---|---|
bin | 111100100110011110… |
… | …1000110001000111111 |
3 | 110102220200120020010101 |
4 | 1321030331012020333 |
5 | 4113011331300411 |
6 | 135441402021531 |
7 | 12254664424405 |
oct | 1711475061077 |
9 | 412820506111 |
10 | 130140103231 |
11 | 50212771826 |
12 | 2127b7a78a7 |
13 | c36cc19b58 |
14 | 6427d39475 |
15 | 35ba2da8c1 |
hex | 1e4cf4623f |
130140103231 has 8 divisors (see below), whose sum is σ = 130251711744. Its totient is φ = 130028535000.
The previous prime is 130140103123. The next prime is 130140103237. The reversal of 130140103231 is 132301041031.
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 130140103231 - 27 = 130140103103 is a prime.
It is a super-2 number, since 2×1301401032312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130140103199 and 130140103208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130140103237) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11561356 + ... + 11572606.
It is an arithmetic number, because the mean of its divisors is an integer number (16281463968).
Almost surely, 2130140103231 is an apocalyptic number.
130140103231 is a deficient number, since it is larger than the sum of its proper divisors (111608513).
130140103231 is a wasteful number, since it uses less digits than its factorization.
130140103231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20141.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 130140103231 its reverse (132301041031), we get a palindrome (262441144262).
The spelling of 130140103231 in words is "one hundred thirty billion, one hundred forty million, one hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •