Base | Representation |
---|---|
bin | 11010110101101101… |
… | …00111111001110110 |
3 | 1101012012101201001100 |
4 | 31122312213321312 |
5 | 214002221424200 |
6 | 10341450310530 |
7 | 1020033633405 |
oct | 153266477166 |
9 | 41165351040 |
10 | 14409170550 |
11 | 6124668115 |
12 | 2961728446 |
13 | 1488311628 |
14 | 9a998763c |
15 | 595008d00 |
hex | 35ada7e76 |
14409170550 has 144 divisors (see below), whose sum is σ = 40463972640. Its totient is φ = 3671377920.
The previous prime is 14409170509. The next prime is 14409170557. The reversal of 14409170550 is 5507190441.
14409170550 is a `hidden beast` number, since 14 + 4 + 0 + 91 + 7 + 0 + 550 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14409170557) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1260159 + ... + 1271541.
It is an arithmetic number, because the mean of its divisors is an integer number (280999810).
Almost surely, 214409170550 is an apocalyptic number.
14409170550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14409170550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20231986320).
14409170550 is an abundant number, since it is smaller than the sum of its proper divisors (26054802090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14409170550 is a wasteful number, since it uses less digits than its factorization.
14409170550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11527 (or 11519 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 36.
The spelling of 14409170550 in words is "fourteen billion, four hundred nine million, one hundred seventy thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •