Base | Representation |
---|---|
bin | 11010011110001101… |
… | …11110101001111010 |
3 | 1100200110122002012220 |
4 | 31033012332221322 |
5 | 213101301201300 |
6 | 10310131144510 |
7 | 1012122060366 |
oct | 151706765172 |
9 | 40613562186 |
10 | 14212131450 |
11 | 6033417790 |
12 | 2907745136 |
13 | 1456552c4a |
14 | 98b7362a6 |
15 | 582a86da0 |
hex | 34f1bea7a |
14212131450 has 96 divisors (see below), whose sum is σ = 38727521280. Its totient is φ = 3420523200.
The previous prime is 14212131433. The next prime is 14212131463. The reversal of 14212131450 is 5413121241.
It is a self number, because there is not a number n which added to its sum of digits gives 14212131450.
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, 198367 + ... + 260333.
It is an arithmetic number, because the mean of its divisors is an integer number (403411680).
Almost surely, 214212131450 is an apocalyptic number.
14212131450 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 14212131450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19363760640).
14212131450 is an abundant number, since it is smaller than the sum of its proper divisors (24515389830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14212131450 is a wasteful number, since it uses less digits than its factorization.
14212131450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62132 (or 62127 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 14212131450 its reverse (5413121241), we get a palindrome (19625252691).
The spelling of 14212131450 in words is "fourteen billion, two hundred twelve million, one hundred thirty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •