Base | Representation |
---|---|
bin | 11001110100110000… |
… | …10100011010010000 |
3 | 1022210020020020021010 |
4 | 30322120110122100 |
5 | 211343233333342 |
6 | 10211425130520 |
7 | 1000400035302 |
oct | 147230243220 |
9 | 38706206233 |
10 | 13864355472 |
11 | 5975081520 |
12 | 282b189a40 |
13 | 13cc498146 |
14 | 957487972 |
15 | 56228c29c |
hex | 33a614690 |
13864355472 has 160 divisors (see below), whose sum is σ = 40983091200. Its totient is φ = 3997762560.
The previous prime is 13864355471. The next prime is 13864355513. The reversal of 13864355472 is 27455346831.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (13864355471) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2413788 + ... + 2419524.
It is an arithmetic number, because the mean of its divisors is an integer number (256144320).
Almost surely, 213864355472 is an apocalyptic number.
13864355472 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 13864355472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20491545600).
13864355472 is an abundant number, since it is smaller than the sum of its proper divisors (27118735728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13864355472 is a wasteful number, since it uses less digits than its factorization.
13864355472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5981 (or 5975 counting only the distinct ones).
The product of its digits is 2419200, while the sum is 48.
The spelling of 13864355472 in words is "thirteen billion, eight hundred sixty-four million, three hundred fifty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •