Base | Representation |
---|---|
bin | 111100101011010001… |
… | …0111100101101010101 |
3 | 110110022220100200211020 |
4 | 1321112202330231111 |
5 | 4113324030133023 |
6 | 135505351031353 |
7 | 12261660255432 |
oct | 1712642745525 |
9 | 413286320736 |
10 | 130301021013 |
11 | 50295590729 |
12 | 2130566b559 |
13 | c39736c287 |
14 | 6441466b89 |
15 | 35c94c4de3 |
hex | 1e568bcb55 |
130301021013 has 8 divisors (see below), whose sum is σ = 174841285728. Its totient is φ = 86314051824.
The previous prime is 130301020931. The next prime is 130301021023. The reversal of 130301021013 is 310120103031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130301021013 - 217 = 130300889941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130301020983 and 130301021001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130301021023) 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, 138323331 + ... + 138324272.
It is an arithmetic number, because the mean of its divisors is an integer number (21855160716).
Almost surely, 2130301021013 is an apocalyptic number.
It is an amenable number.
130301021013 is a deficient number, since it is larger than the sum of its proper divisors (44540264715).
130301021013 is a wasteful number, since it uses less digits than its factorization.
130301021013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276647763.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 130301021013 its reverse (310120103031), we get a palindrome (440421124044).
The spelling of 130301021013 in words is "one hundred thirty billion, three hundred one million, twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •