Base | Representation |
---|---|
bin | 11010110011000010… |
… | …01110101010000000 |
3 | 1101010122021101201001 |
4 | 31121201032222000 |
5 | 213431004104041 |
6 | 10335330421344 |
7 | 1016342440201 |
oct | 153141165200 |
9 | 41118241631 |
10 | 14386784896 |
11 | 6112a68480 |
12 | 2956131854 |
13 | 14837a4393 |
14 | 9a69db5a8 |
15 | 593086131 |
hex | 35984ea80 |
14386784896 has 64 divisors (see below), whose sum is σ = 31323996000. Its totient is φ = 6527472640.
The previous prime is 14386784887. The next prime is 14386784903. The reversal of 14386784896 is 69848768341.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-3 number, since 3×143867848963 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 783630 + ... + 801778.
Almost surely, 214386784896 is an apocalyptic number.
14386784896 is a gapful number since it is divisible by the number (16) 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 14386784896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15661998000).
14386784896 is an abundant number, since it is smaller than the sum of its proper divisors (16937211104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14386784896 is a wasteful number, since it uses less digits than its factorization.
14386784896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18737 (or 18725 counting only the distinct ones).
The product of its digits is 55738368, while the sum is 64.
The spelling of 14386784896 in words is "fourteen billion, three hundred eighty-six million, seven hundred eighty-four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •