Base | Representation |
---|---|
bin | 11000010100011101… |
… | …00000101011010011 |
3 | 1020200221001210120211 |
4 | 30022032200223103 |
5 | 203214424243112 |
6 | 5555325344551 |
7 | 641360142154 |
oct | 141216405323 |
9 | 36627053524 |
10 | 13056477907 |
11 | 55a0050110 |
12 | 2644708157 |
13 | 1300cb7795 |
14 | 8bc06b92b |
15 | 5163ab0a7 |
hex | 30a3a0ad3 |
13056477907 has 4 divisors (see below), whose sum is σ = 14243430456. Its totient is φ = 11869525360.
The previous prime is 13056477901. The next prime is 13056477913. The reversal of 13056477907 is 70977465031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 70977465031 = 11 ⋅6452496821.
It is an interprime number because it is at equal distance from previous prime (13056477901) and next prime (13056477913).
It is not a de Polignac number, because 13056477907 - 23 = 13056477899 is a prime.
It is a Smith number, since the sum of its digits (49) 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 (13056477901) 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, 593476258 + ... + 593476279.
It is an arithmetic number, because the mean of its divisors is an integer number (3560857614).
Almost surely, 213056477907 is an apocalyptic number.
13056477907 is a deficient number, since it is larger than the sum of its proper divisors (1186952549).
13056477907 is a wasteful number, since it uses less digits than its factorization.
13056477907 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1186952548.
The product of its (nonzero) digits is 1111320, while the sum is 49.
The spelling of 13056477907 in words is "thirteen billion, fifty-six million, four hundred seventy-seven thousand, nine hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •