Base | Representation |
---|---|
bin | 11010010111001011… |
… | …00110111111110110 |
3 | 1100112100110112122200 |
4 | 31023211212333312 |
5 | 212441140132100 |
6 | 10300221005330 |
7 | 1010503646466 |
oct | 151345467766 |
9 | 40470415580 |
10 | 14153052150 |
11 | 6003035616 |
12 | 28ab9b3846 |
13 | 1447239093 |
14 | 983957ba6 |
15 | 57c7b6e00 |
hex | 34b966ff6 |
14153052150 has 144 divisors (see below), whose sum is σ = 38552514624. Its totient is φ = 3722135040.
The previous prime is 14153052097. The next prime is 14153052163. The reversal of 14153052150 is 5125035141.
14153052150 is a `hidden beast` number, since 1 + 41 + 53 + 0 + 521 + 50 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 10664787 + ... + 10666113.
It is an arithmetic number, because the mean of its divisors is an integer number (267725796).
Almost surely, 214153052150 is an apocalyptic number.
14153052150 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 14153052150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19276257312).
14153052150 is an abundant number, since it is smaller than the sum of its proper divisors (24399462474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14153052150 is a wasteful number, since it uses less digits than its factorization.
14153052150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1655 (or 1647 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 14153052150 its reverse (5125035141), we get a palindrome (19278087291).
The spelling of 14153052150 in words is "fourteen billion, one hundred fifty-three million, fifty-two thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •