Base | Representation |
---|---|
bin | 1111100010110… |
… | …11111100100011 |
3 | 100002101000012221 |
4 | 13301123330203 |
5 | 231340300120 |
6 | 20534531511 |
7 | 3142245013 |
oct | 761337443 |
9 | 302330187 |
10 | 130400035 |
11 | 67675527 |
12 | 37806b97 |
13 | 210288ac |
14 | 13465c43 |
15 | b6ac0aa |
hex | 7c5bf23 |
130400035 has 4 divisors (see below), whose sum is σ = 156480048. Its totient is φ = 104320024.
The previous prime is 130400033. The next prime is 130400057. The reversal of 130400035 is 530004031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 530004031 = 19 ⋅27894949.
It is a cyclic number.
It is not a de Polignac number, because 130400035 - 21 = 130400033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130399991 and 130400018.
It is not an unprimeable number, because it can be changed into a prime (130400033) 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, 13039999 + ... + 13040008.
It is an arithmetic number, because the mean of its divisors is an integer number (39120012).
Almost surely, 2130400035 is an apocalyptic number.
130400035 is a deficient number, since it is larger than the sum of its proper divisors (26080013).
130400035 is an equidigital number, since it uses as much as digits as its factorization.
130400035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26080012.
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 130400035 is about 11419.2834713917. The cubic root of 130400035 is about 507.0987842222.
Adding to 130400035 its reverse (530004031), we get a palindrome (660404066).
The spelling of 130400035 in words is "one hundred thirty million, four hundred thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •