Base | Representation |
---|---|
bin | 11000011010010010… |
… | …11011100101010001 |
3 | 1020211100021021000221 |
4 | 30031021123211101 |
5 | 203320000243334 |
6 | 10004235513041 |
7 | 642523503403 |
oct | 141511334521 |
9 | 36740237027 |
10 | 13105477969 |
11 | 5615778631 |
12 | 2658bb8781 |
13 | 130b1b29bc |
14 | 8c4784b73 |
15 | 51a8398b4 |
hex | 30d25b951 |
13105477969 has 4 divisors (see below), whose sum is σ = 13106559796. Its totient is φ = 13104396144.
The previous prime is 13105477967. The next prime is 13105478011. The reversal of 13105477969 is 96977450131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 96977450131 = 191 ⋅507735341.
It can be written as a sum of positive squares in 2 ways, for example, as 4835394369 + 8270083600 = 69537^2 + 90940^2 .
It is a cyclic number.
It is not a de Polignac number, because 13105477969 - 21 = 13105477967 is a prime.
It is a super-2 number, since 2×131054779692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13105477963) 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, 522534 + ... + 547039.
It is an arithmetic number, because the mean of its divisors is an integer number (3276639949).
Almost surely, 213105477969 is an apocalyptic number.
It is an amenable number.
13105477969 is a deficient number, since it is larger than the sum of its proper divisors (1081827).
13105477969 is a wasteful number, since it uses less digits than its factorization.
13105477969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1081826.
The product of its (nonzero) digits is 1428840, while the sum is 52.
The spelling of 13105477969 in words is "thirteen billion, one hundred five million, four hundred seventy-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •