Base | Representation |
---|---|
bin | 111100110001010110… |
… | …1110110011100000111 |
3 | 110110212010120100022001 |
4 | 1321202231312130013 |
5 | 4114233313034021 |
6 | 135541523250131 |
7 | 12300016641502 |
oct | 1714255663407 |
9 | 413763510261 |
10 | 130505205511 |
11 | 5038a87154a |
12 | 21361b19947 |
13 | c3ca7600c5 |
14 | 6460618139 |
15 | 35dc3a9091 |
hex | 1e62b76707 |
130505205511 has 4 divisors (see below), whose sum is σ = 130512017272. Its totient is φ = 130498393752.
The previous prime is 130505205503. The next prime is 130505205527. The reversal of 130505205511 is 115502505031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 115502505031 = 33247 ⋅3474073.
It is a cyclic number.
It is not a de Polignac number, because 130505205511 - 23 = 130505205503 is a prime.
It is a super-2 number, since 2×1305052055112 (a number of 23 digits) contains 22 as substring.
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 130505205511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130505205811) 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, 3377061 + ... + 3415486.
It is an arithmetic number, because the mean of its divisors is an integer number (32628004318).
Almost surely, 2130505205511 is an apocalyptic number.
130505205511 is a deficient number, since it is larger than the sum of its proper divisors (6811761).
130505205511 is an equidigital number, since it uses as much as digits as its factorization.
130505205511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811760.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 130505205511 in words is "one hundred thirty billion, five hundred five million, two hundred five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •