Base | Representation |
---|---|
bin | 11000001110000010… |
… | …01101000101010101 |
3 | 1020120011210110201212 |
4 | 30013001031011111 |
5 | 203112140030013 |
6 | 5550124031205 |
7 | 640134525203 |
oct | 140701150525 |
9 | 36504713655 |
10 | 13002658133 |
11 | 5572730563 |
12 | 262a692505 |
13 | 12c2ac286a |
14 | 8b4c5c073 |
15 | 5117c96a8 |
hex | 30704d155 |
13002658133 has 4 divisors (see below), whose sum is σ = 13043676300. Its totient is φ = 12961639968.
The previous prime is 13002658099. The next prime is 13002658211. The reversal of 13002658133 is 33185620031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33185620031 = 53017 ⋅625943.
It can be written as a sum of positive squares in 2 ways, for example, as 360354289 + 12642303844 = 18983^2 + 112438^2 .
It is a cyclic number.
It is not a de Polignac number, because 13002658133 - 214 = 13002641749 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13002658133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13002651133) 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, 20508608 + ... + 20509241.
It is an arithmetic number, because the mean of its divisors is an integer number (3260919075).
Almost surely, 213002658133 is an apocalyptic number.
It is an amenable number.
13002658133 is a deficient number, since it is larger than the sum of its proper divisors (41018167).
13002658133 is an equidigital number, since it uses as much as digits as its factorization.
13002658133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41018166.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 13002658133 in words is "thirteen billion, two million, six hundred fifty-eight thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •