Base | Representation |
---|---|
bin | 11010010111001011… |
… | …10011111001110000 |
3 | 1100112100120020011101 |
4 | 31023211303321300 |
5 | 212441143330013 |
6 | 10300222054144 |
7 | 1010504256550 |
oct | 151345637160 |
9 | 40470506141 |
10 | 14153105008 |
11 | 60030712a9 |
12 | 28aba1a354 |
13 | 1447257163 |
14 | 98396d160 |
15 | 57c7c78dd |
hex | 34b973e70 |
14153105008 has 80 divisors (see below), whose sum is σ = 31571640000. Its totient is φ = 6020775936.
The previous prime is 14153104981. The next prime is 14153105009. The reversal of 14153105008 is 80050135141.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14153105009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11515338 + ... + 11516566.
It is an arithmetic number, because the mean of its divisors is an integer number (394645500).
Almost surely, 214153105008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14153105008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15785820000).
14153105008 is an abundant number, since it is smaller than the sum of its proper divisors (17418534992).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14153105008 is a wasteful number, since it uses less digits than its factorization.
14153105008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1922 (or 1916 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 28.
The spelling of 14153105008 in words is "fourteen billion, one hundred fifty-three million, one hundred five thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •