Base | Representation |
---|---|
bin | 111100110001010111… |
… | …0001110101111011011 |
3 | 110110212010202101211201 |
4 | 1321202232032233123 |
5 | 4114233324230201 |
6 | 135541525335031 |
7 | 12300020534632 |
oct | 1714256165733 |
9 | 413763671751 |
10 | 130505305051 |
11 | 5038a92a310 |
12 | 21361b67477 |
13 | c3ca7964c4 |
14 | 6460642519 |
15 | 35dc3c8801 |
hex | 1e62b8ebdb |
130505305051 has 4 divisors (see below), whose sum is σ = 142369423704. Its totient is φ = 118641186400.
The previous prime is 130505305043. The next prime is 130505305069. The reversal of 130505305051 is 150503505031.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 130505305051 - 23 = 130505305043 is a prime.
It is a super-2 number, since 2×1305053050512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130505305001) 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 3 ways as a sum of consecutive naturals, for example, 5932059310 + ... + 5932059331.
It is an arithmetic number, because the mean of its divisors is an integer number (35592355926).
Almost surely, 2130505305051 is an apocalyptic number.
130505305051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130505305051 is a deficient number, since it is larger than the sum of its proper divisors (11864118653).
130505305051 is a wasteful number, since it uses less digits than its factorization.
130505305051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11864118652.
The product of its (nonzero) digits is 5625, while the sum is 28.
The spelling of 130505305051 in words is "one hundred thirty billion, five hundred five million, three hundred five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •