Base | Representation |
---|---|
bin | 111100101101000100… |
… | …0111111011111110001 |
3 | 110110111002211111002201 |
4 | 1321122020333133301 |
5 | 4113434444404203 |
6 | 135515343343201 |
7 | 12263321661424 |
oct | 1713210773761 |
9 | 413432744081 |
10 | 130361325553 |
11 | 5031662a398 |
12 | 213218b1b01 |
13 | c3a69c4a34 |
14 | 64494839bb |
15 | 35ce937e1d |
hex | 1e5a23f7f1 |
130361325553 has 8 divisors (see below), whose sum is σ = 133904108160. Its totient is φ = 126819569520.
The previous prime is 130361325529. The next prime is 130361325599. The reversal of 130361325553 is 355523163031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130361325553 - 225 = 130327771121 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130361328553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4338 + ... + 510628.
It is an arithmetic number, because the mean of its divisors is an integer number (16738013520).
Almost surely, 2130361325553 is an apocalyptic number.
It is an amenable number.
130361325553 is a deficient number, since it is larger than the sum of its proper divisors (3542782607).
130361325553 is an equidigital number, since it uses as much as digits as its factorization.
130361325553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513287.
The product of its (nonzero) digits is 121500, while the sum is 37.
Adding to 130361325553 its reverse (355523163031), we get a palindrome (485884488584).
The spelling of 130361325553 in words is "one hundred thirty billion, three hundred sixty-one million, three hundred twenty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.409 sec. • engine limits •