Base | Representation |
---|---|
bin | 111100101111101101… |
… | …1010101110010001001 |
3 | 110110201021201201002021 |
4 | 1321133123111302021 |
5 | 4114130201142023 |
6 | 135532232404441 |
7 | 12265446613300 |
oct | 1713733256211 |
9 | 413637651067 |
10 | 130450021513 |
11 | 503616aaa39 |
12 | 21347546721 |
13 | c3bc1ab256 |
14 | 6457171437 |
15 | 35d760835d |
hex | 1e5f6d5c89 |
130450021513 has 12 divisors (see below), whose sum is σ = 151765466052. Its totient is φ = 111801422880.
The previous prime is 130450021501. The next prime is 130450021517. The reversal of 130450021513 is 315120054031.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 39663510649 + 90786510864 = 199157^2 + 301308^2 .
It is not a de Polignac number, because 130450021513 - 233 = 121860086921 is a prime.
It is a super-2 number, since 2×1304500215132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130450021517) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 289231 + ... + 586987.
It is an arithmetic number, because the mean of its divisors is an integer number (12647122171).
Almost surely, 2130450021513 is an apocalyptic number.
It is an amenable number.
130450021513 is a deficient number, since it is larger than the sum of its proper divisors (21315444539).
130450021513 is an equidigital number, since it uses as much as digits as its factorization.
130450021513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306712 (or 306705 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Adding to 130450021513 its reverse (315120054031), we get a palindrome (445570075544).
The spelling of 130450021513 in words is "one hundred thirty billion, four hundred fifty million, twenty-one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •