Base | Representation |
---|---|
bin | 1111011111110… |
… | …11111011100001 |
3 | 100001122000201221 |
4 | 13233323323201 |
5 | 231240204003 |
6 | 20522255041 |
7 | 3136016302 |
oct | 757737341 |
9 | 301560657 |
10 | 130006753 |
11 | 67426aa8 |
12 | 37657481 |
13 | 20c1b896 |
14 | 133a27a9 |
15 | b6307bd |
hex | 7bfbee1 |
130006753 has 4 divisors (see below), whose sum is σ = 130029568. Its totient is φ = 129983940.
The previous prime is 130006717. The next prime is 130006763. The reversal of 130006753 is 357600031.
It is a happy number.
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, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 357600031 = 12721 ⋅28111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130006753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130006763) 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, 5200 + ... + 16942.
It is an arithmetic number, because the mean of its divisors is an integer number (32507392).
Almost surely, 2130006753 is an apocalyptic number.
It is an amenable number.
130006753 is a deficient number, since it is larger than the sum of its proper divisors (22815).
130006753 is a wasteful number, since it uses less digits than its factorization.
130006753 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22814.
The product of its (nonzero) digits is 1890, while the sum is 25.
The square root of 130006753 is about 11402.0503857859. The cubic root of 130006753 is about 506.5884733806.
Adding to 130006753 its reverse (357600031), we get a palindrome (487606784).
The spelling of 130006753 in words is "one hundred thirty million, six thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •