Base | Representation |
---|---|
bin | 11000111101110011… |
… | …00111011111100110 |
3 | 1021121002201022201000 |
4 | 30132321213133212 |
5 | 204422222303332 |
6 | 10053555414130 |
7 | 653101234344 |
oct | 143671473746 |
9 | 37532638630 |
10 | 13403322342 |
11 | 575890a503 |
12 | 27208b4346 |
13 | 1357b07587 |
14 | 912156994 |
15 | 536a6eb7c |
hex | 31ee677e6 |
13403322342 has 128 divisors (see below), whose sum is σ = 33324480000. Its totient is φ = 3982151808.
The previous prime is 13403322311. The next prime is 13403322343. The reversal of 13403322342 is 24322330431.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13403322343) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5039409 + ... + 5042067.
It is an arithmetic number, because the mean of its divisors is an integer number (260347500).
Almost surely, 213403322342 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13403322342, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16662240000).
13403322342 is an abundant number, since it is smaller than the sum of its proper divisors (19921157658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13403322342 is a wasteful number, since it uses less digits than its factorization.
13403322342 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2740 (or 2700 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 13403322342 its reverse (24322330431), we get a palindrome (37725652773).
The spelling of 13403322342 in words is "thirteen billion, four hundred three million, three hundred twenty-two thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •