Base | Representation |
---|---|
bin | 111100101011000110… |
… | …0000000011011000001 |
3 | 110110022111001011000210 |
4 | 1321112030000123001 |
5 | 4113321010210123 |
6 | 135505014104333 |
7 | 12261555166551 |
oct | 1712614003301 |
9 | 413274034023 |
10 | 130295006913 |
11 | 502921531a5 |
12 | 2130364b0a9 |
13 | c396044a36 |
14 | 644073d161 |
15 | 35c8bd7e93 |
hex | 1e563006c1 |
130295006913 has 4 divisors (see below), whose sum is σ = 173726675888. Its totient is φ = 86863337940.
The previous prime is 130295006911. The next prime is 130295006951. The reversal of 130295006913 is 319600592031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 130295006913 - 21 = 130295006911 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130295006911) 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, 21715834483 + ... + 21715834488.
It is an arithmetic number, because the mean of its divisors is an integer number (43431668972).
Almost surely, 2130295006913 is an apocalyptic number.
It is an amenable number.
130295006913 is a deficient number, since it is larger than the sum of its proper divisors (43431668975).
130295006913 is an equidigital number, since it uses as much as digits as its factorization.
130295006913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43431668974.
The product of its (nonzero) digits is 43740, while the sum is 39.
Adding to 130295006913 its reverse (319600592031), we get a palindrome (449895598944).
The spelling of 130295006913 in words is "one hundred thirty billion, two hundred ninety-five million, six thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •