Base | Representation |
---|---|
bin | 11010000010101110… |
… | …01101111010000000 |
3 | 1100002101200011020000 |
4 | 31001113031322000 |
5 | 212113231212300 |
6 | 10231212120000 |
7 | 1003321564443 |
oct | 150127157200 |
9 | 40071604200 |
10 | 13981507200 |
11 | 5a25218331 |
12 | 2862466000 |
13 | 141a8357ab |
14 | 968c6165a |
15 | 56c6cdc00 |
hex | 3415cde80 |
13981507200 has 960 divisors, whose sum is σ = 57849422400. Its totient is φ = 3304488960.
The previous prime is 13981507187. The next prime is 13981507223. The reversal of 13981507200 is 270518931.
It is a tau number, because it is divible by the number of its divisors (960).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 83721517 + ... + 83721683.
It is an arithmetic number, because the mean of its divisors is an integer number (60259815).
Almost surely, 213981507200 is an apocalyptic number.
13981507200 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 13981507200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28924711200).
13981507200 is an abundant number, since it is smaller than the sum of its proper divisors (43867915200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13981507200 is a wasteful number, since it uses less digits than its factorization.
13981507200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 239 (or 213 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The spelling of 13981507200 in words is "thirteen billion, nine hundred eighty-one million, five hundred seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •