Base | Representation |
---|---|
bin | 111100100010010100… |
… | …1000111111100011101 |
3 | 110102112222011021021101 |
4 | 1321010221013330131 |
5 | 4112220131300023 |
6 | 135415501033101 |
7 | 12251352202303 |
oct | 1710451077435 |
9 | 412488137241 |
10 | 130000650013 |
11 | 50150a83533 |
12 | 21240b55791 |
13 | c34a071660 |
14 | 64135d8273 |
15 | 35ace411ad |
hex | 1e44a47f1d |
130000650013 has 4 divisors (see below), whose sum is σ = 140000700028. Its totient is φ = 120000600000.
The previous prime is 130000650011. The next prime is 130000650097. The reversal of 130000650013 is 310056000031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 89399206009 + 40601444004 = 298997^2 + 201498^2 .
It is a cyclic number.
It is not a de Polignac number, because 130000650013 - 21 = 130000650011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130000650011) 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, 5000024988 + ... + 5000025013.
It is an arithmetic number, because the mean of its divisors is an integer number (35000175007).
Almost surely, 2130000650013 is an apocalyptic number.
130000650013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130000650013 is a deficient number, since it is larger than the sum of its proper divisors (10000050015).
130000650013 is a wasteful number, since it uses less digits than its factorization.
130000650013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10000050014.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 130000650013 its reverse (310056000031), we get a palindrome (440056650044).
The spelling of 130000650013 in words is "one hundred thirty billion, six hundred fifty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •