Base | Representation |
---|---|
bin | 11010001101010101… |
… | …10101110110000000 |
3 | 1100022121012100222020 |
4 | 31012222311312000 |
5 | 212304024200400 |
6 | 10244112241440 |
7 | 1005452411340 |
oct | 150652656600 |
9 | 40277170866 |
10 | 14070537600 |
11 | 5a704a7179 |
12 | 2888240280 |
13 | 14331082c2 |
14 | 9769d8d20 |
15 | 5754182a0 |
hex | 346ab5d80 |
14070537600 has 384 divisors, whose sum is σ = 54406636800. Its totient is φ = 3128647680.
The previous prime is 14070537589. The next prime is 14070537601. The reversal of 14070537600 is 673507041.
It is a tau number, because it is divible by the number of its divisors (384).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14070537601) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2483571 + ... + 2489229.
It is an arithmetic number, because the mean of its divisors is an integer number (141683950).
Almost surely, 214070537600 is an apocalyptic number.
14070537600 is a gapful number since it is divisible by the number (10) 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 14070537600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27203318400).
14070537600 is an abundant number, since it is smaller than the sum of its proper divisors (40336099200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14070537600 is a wasteful number, since it uses less digits than its factorization.
14070537600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5730 (or 5713 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 33.
The spelling of 14070537600 in words is "fourteen billion, seventy million, five hundred thirty-seven thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •