Base | Representation |
---|---|
bin | 11001111001110100… |
… | …10011000111000000 |
3 | 1022220012010112011210 |
4 | 30330322103013000 |
5 | 211440121124342 |
6 | 10215543210120 |
7 | 1001423666232 |
oct | 147472230700 |
9 | 38805115153 |
10 | 13906817472 |
11 | 5997043889 |
12 | 2841446940 |
13 | 14082144a2 |
14 | 95cd7c252 |
15 | 565d7879c |
hex | 33ce931c0 |
13906817472 has 112 divisors (see below), whose sum is σ = 37175846400. Its totient is φ = 4587847680.
The previous prime is 13906817467. The next prime is 13906817539. The reversal of 13906817472 is 27471860931.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18083904 + ... + 18084672.
It is an arithmetic number, because the mean of its divisors is an integer number (331927200).
Almost surely, 213906817472 is an apocalyptic number.
13906817472 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13906817472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18587923200).
13906817472 is an abundant number, since it is smaller than the sum of its proper divisors (23269028928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13906817472 is a wasteful number, since it uses less digits than its factorization.
13906817472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1634 (or 1624 counting only the distinct ones).
The product of its (nonzero) digits is 508032, while the sum is 48.
The spelling of 13906817472 in words is "thirteen billion, nine hundred six million, eight hundred seventeen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •