Base | Representation |
---|---|
bin | 11010110101011100… |
… | …01001010010100000 |
3 | 1101012001012210021200 |
4 | 31122232021102200 |
5 | 214001134314000 |
6 | 10341330521200 |
7 | 1020006015564 |
oct | 153256112240 |
9 | 41161183250 |
10 | 14406948000 |
11 | 612338a2a5 |
12 | 2960a36200 |
13 | 1487a13b03 |
14 | 9a95696a4 |
15 | 594c1a500 |
hex | 35ab894a0 |
14406948000 has 288 divisors, whose sum is σ = 51476115600. Its totient is φ = 3815884800.
The previous prime is 14406947987. The next prime is 14406948041. The reversal of 14406948000 is 84960441.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 1484715024 + 12922232976 = 38532^2 + 113676^2 .
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5650726 + ... + 5653274.
Almost surely, 214406948000 is an apocalyptic number.
14406948000 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 14406948000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25738057800).
14406948000 is an abundant number, since it is smaller than the sum of its proper divisors (37069167600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14406948000 is a wasteful number, since it uses less digits than its factorization.
14406948000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2737 (or 2716 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The spelling of 14406948000 in words is "fourteen billion, four hundred six million, nine hundred forty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •