Base | Representation |
---|---|
bin | 11000111110000001… |
… | …10101101000000000 |
3 | 1021121020021111021001 |
4 | 30133000311220000 |
5 | 204423213341412 |
6 | 10054104141344 |
7 | 653123310103 |
oct | 143700655000 |
9 | 37536244231 |
10 | 13405215232 |
11 | 5759992682 |
12 | 2721467854 |
13 | 135831b026 |
14 | 9124ca73a |
15 | 536ce5957 |
hex | 31f035a00 |
13405215232 has 40 divisors (see below), whose sum is σ = 26891216352. Its totient is φ = 6675840000.
The previous prime is 13405215221. The next prime is 13405215233. The reversal of 13405215232 is 23251250431.
It is a self number, because there is not a number n which added to its sum of digits gives 13405215232.
It is not an unprimeable number, because it can be changed into a prime (13405215233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 76357 + ... + 180667.
Almost surely, 213405215232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13405215232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13445608176).
13405215232 is an abundant number, since it is smaller than the sum of its proper divisors (13486001120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13405215232 is an equidigital number, since it uses as much as digits as its factorization.
13405215232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104580 (or 104564 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
Adding to 13405215232 its reverse (23251250431), we get a palindrome (36656465663).
The spelling of 13405215232 in words is "thirteen billion, four hundred five million, two hundred fifteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •