Base | Representation |
---|---|
bin | 111100110001010001… |
… | …1110010011100010011 |
3 | 110110211221121022220022 |
4 | 1321202203302130103 |
5 | 4114232124131244 |
6 | 135541350534055 |
7 | 12266655344210 |
oct | 1714243623423 |
9 | 413757538808 |
10 | 130502567699 |
11 | 5038932a739 |
12 | 2136106732b |
13 | c3ca04857a |
14 | 646012cb07 |
15 | 35dc0376ee |
hex | 1e628f2713 |
130502567699 has 4 divisors (see below), whose sum is σ = 149145791664. Its totient is φ = 111859343736.
The previous prime is 130502567687. The next prime is 130502567707. The reversal of 130502567699 is 996765205031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 996765205031 = 59 ⋅16894325509.
It is not a de Polignac number, because 130502567699 - 24 = 130502567683 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 130502567699.
It is not an unprimeable number, because it can be changed into a prime (130502527699) 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 in 3 ways as a sum of consecutive naturals, for example, 9321611972 + ... + 9321611985.
It is an arithmetic number, because the mean of its divisors is an integer number (37286447916).
Almost surely, 2130502567699 is an apocalyptic number.
130502567699 is a deficient number, since it is larger than the sum of its proper divisors (18643223965).
130502567699 is an equidigital number, since it uses as much as digits as its factorization.
130502567699 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18643223964.
The product of its (nonzero) digits is 3061800, while the sum is 53.
The spelling of 130502567699 in words is "one hundred thirty billion, five hundred two million, five hundred sixty-seven thousand, six hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •