Base | Representation |
---|---|
bin | 111100100110110111… |
… | …0011001110010000001 |
3 | 110102221120212220120211 |
4 | 1321031232121302001 |
5 | 4113023133404422 |
6 | 135442543034121 |
7 | 12255212330164 |
oct | 1711556316201 |
9 | 412846786524 |
10 | 130153028737 |
11 | 50219a9a966 |
12 | 21283b9b941 |
13 | c3727c4194 |
14 | 6429941adb |
15 | 35bb4e0577 |
hex | 1e4db99c81 |
130153028737 has 2 divisors, whose sum is σ = 130153028738. Its totient is φ = 130153028736.
The previous prime is 130153028723. The next prime is 130153028741. The reversal of 130153028737 is 737820351031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124292207601 + 5860821136 = 352551^2 + 76556^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130153028737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 130153028737.
It is not a weakly prime, because it can be changed into another prime (130153028777) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65076514368 + 65076514369.
It is an arithmetic number, because the mean of its divisors is an integer number (65076514369).
Almost surely, 2130153028737 is an apocalyptic number.
It is an amenable number.
130153028737 is a deficient number, since it is larger than the sum of its proper divisors (1).
130153028737 is an equidigital number, since it uses as much as digits as its factorization.
130153028737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105840, while the sum is 40.
Adding to 130153028737 its reverse (737820351031), we get a palindrome (867973379768).
The spelling of 130153028737 in words is "one hundred thirty billion, one hundred fifty-three million, twenty-eight thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •