Base | Representation |
---|---|
bin | 11000010101001110… |
… | …00101100100010011 |
3 | 1020201101012010010011 |
4 | 30022213011210103 |
5 | 203223101423332 |
6 | 10000115415351 |
7 | 641465664142 |
oct | 141247054423 |
9 | 36641163104 |
10 | 13062920467 |
11 | 55a3750543 |
12 | 26468b4557 |
13 | 130243204c |
14 | 8bcc67759 |
15 | 516c2ee47 |
hex | 30a9c5913 |
13062920467 has 4 divisors (see below), whose sum is σ = 13104128736. Its totient is φ = 13021712200.
The previous prime is 13062920401. The next prime is 13062920491. The reversal of 13062920467 is 76402926031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 76402926031 = 179 ⋅426831989.
It is a cyclic number.
It is not a de Polignac number, because 13062920467 - 215 = 13062887699 is a prime.
It is a super-2 number, since 2×130629204672 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13062920267) 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, 20603659 + ... + 20604292.
It is an arithmetic number, because the mean of its divisors is an integer number (3276032184).
Almost surely, 213062920467 is an apocalyptic number.
13062920467 is a deficient number, since it is larger than the sum of its proper divisors (41208269).
13062920467 is an equidigital number, since it uses as much as digits as its factorization.
13062920467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41208268.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 13062920467 in words is "thirteen billion, sixty-two million, nine hundred twenty thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •