Base | Representation |
---|---|
bin | 111100100101011000… |
… | …0110011001001000011 |
3 | 110102211010100201012222 |
4 | 1321022300303021003 |
5 | 4112422422402001 |
6 | 135434005441255 |
7 | 12254040006104 |
oct | 1711260631103 |
9 | 412733321188 |
10 | 130103325251 |
11 | 501a3a319a9 |
12 | 2126b41022b |
13 | c365410a33 |
14 | 64230c43ab |
15 | 35b6e7361b |
hex | 1e4ac33243 |
130103325251 has 4 divisors (see below), whose sum is σ = 130130531232. Its totient is φ = 130076119272.
The previous prime is 130103325221. The next prime is 130103325259. The reversal of 130103325251 is 152523301031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130103325251 - 218 = 130103063107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130103325251.
It is not an unprimeable number, because it can be changed into a prime (130103325259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13595816 + ... + 13605381.
It is an arithmetic number, because the mean of its divisors is an integer number (32532632808).
Almost surely, 2130103325251 is an apocalyptic number.
130103325251 is a deficient number, since it is larger than the sum of its proper divisors (27205981).
130103325251 is an equidigital number, since it uses as much as digits as its factorization.
130103325251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27205980.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 130103325251 its reverse (152523301031), we get a palindrome (282626626282).
The spelling of 130103325251 in words is "one hundred thirty billion, one hundred three million, three hundred twenty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •