Base | Representation |
---|---|
bin | 111100100110001101… |
… | …0110111011101110111 |
3 | 110102220001200100111001 |
4 | 1321030122313131313 |
5 | 4113002032131411 |
6 | 135440441424131 |
7 | 12254525233144 |
oct | 1711432673567 |
9 | 412801610431 |
10 | 130131130231 |
11 | 502086a3223 |
12 | 2127879b047 |
13 | c36b0c789b |
14 | 6426a813cb |
15 | 35b9616dc1 |
hex | 1e4c6b7777 |
130131130231 has 4 divisors (see below), whose sum is σ = 130398340432. Its totient is φ = 129863920032.
The previous prime is 130131130189. The next prime is 130131130277. The reversal of 130131130231 is 132031131031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130131130231 - 213 = 130131122039 is a prime.
It is a super-2 number, since 2×1301311302312 (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 = 130131130199 and 130131130208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130131130331) 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, 133604370 + ... + 133605343.
It is an arithmetic number, because the mean of its divisors is an integer number (32599585108).
Almost surely, 2130131130231 is an apocalyptic number.
130131130231 is a deficient number, since it is larger than the sum of its proper divisors (267210201).
130131130231 is an equidigital number, since it uses as much as digits as its factorization.
130131130231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267210200.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 130131130231 its reverse (132031131031), we get a palindrome (262162261262).
The spelling of 130131130231 in words is "one hundred thirty billion, one hundred thirty-one million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •