Base | Representation |
---|---|
bin | 11000111110001101… |
… | …00001000110100110 |
3 | 1021121100002010112000 |
4 | 30133012201012212 |
5 | 204424104012123 |
6 | 10054200110130 |
7 | 653142050460 |
oct | 143706410646 |
9 | 37540063460 |
10 | 13406704038 |
11 | 575a80a1a2 |
12 | 2721a65346 |
13 | 135871c890 |
14 | 912797130 |
15 | 536edbb43 |
hex | 31f1a11a6 |
13406704038 has 128 divisors (see below), whose sum is σ = 38598067200. Its totient is φ = 3349714176.
The previous prime is 13406704009. The next prime is 13406704039. The reversal of 13406704038 is 83040760431.
It is a junction number, because it is equal to n+sod(n) for n = 13406703993 and 13406704011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13406704039) 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, 21570 + ... + 165162.
It is an arithmetic number, because the mean of its divisors is an integer number (301547400).
Almost surely, 213406704038 is an apocalyptic number.
13406704038 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 13406704038, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19299033600).
13406704038 is an abundant number, since it is smaller than the sum of its proper divisors (25191363162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13406704038 is a wasteful number, since it uses less digits than its factorization.
13406704038 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143643 (or 143637 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The spelling of 13406704038 in words is "thirteen billion, four hundred six million, seven hundred four thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •