Base | Representation |
---|---|
bin | 11000010100100101… |
… | …01101001010011101 |
3 | 1020201000010200010021 |
4 | 30022102231022131 |
5 | 203220214441004 |
6 | 5555405112141 |
7 | 641402402305 |
oct | 141222551235 |
9 | 36630120107 |
10 | 13057577629 |
11 | 55a0731378 |
12 | 2644b58651 |
13 | 13012b11c5 |
14 | 8bc276605 |
15 | 516526d54 |
hex | 30a4ad29d |
13057577629 has 4 divisors (see below), whose sum is σ = 13058333820. Its totient is φ = 13056821440.
The previous prime is 13057577627. The next prime is 13057577633. The reversal of 13057577629 is 92677575031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 92677575031 = 106243 ⋅872317.
It can be written as a sum of positive squares in 2 ways, for example, as 4425309529 + 8632268100 = 66523^2 + 92910^2 .
It is a cyclic number.
It is not a de Polignac number, because 13057577629 - 21 = 13057577627 is a prime.
It is a super-2 number, since 2×130575776292 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13057577627) 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, 351574 + ... + 386935.
It is an arithmetic number, because the mean of its divisors is an integer number (3264583455).
Almost surely, 213057577629 is an apocalyptic number.
It is an amenable number.
13057577629 is a deficient number, since it is larger than the sum of its proper divisors (756191).
13057577629 is an equidigital number, since it uses as much as digits as its factorization.
13057577629 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 756190.
The product of its (nonzero) digits is 2778300, while the sum is 52.
The spelling of 13057577629 in words is "thirteen billion, fifty-seven million, five hundred seventy-seven thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •