Base | Representation |
---|---|
bin | 11010011110001110… |
… | …11011100111000100 |
3 | 1100200110212002220120 |
4 | 31033013123213010 |
5 | 213101314000202 |
6 | 10310133501540 |
7 | 1012123063230 |
oct | 151707334704 |
9 | 40613762816 |
10 | 14212250052 |
11 | 6033498900 |
12 | 29077a18b0 |
13 | 1456594c20 |
14 | 98b7675c0 |
15 | 582aac0bc |
hex | 34f1db9c4 |
14212250052 has 288 divisors, whose sum is σ = 46421894400. Its totient is φ = 3289144320.
The previous prime is 14212250051. The next prime is 14212250093. The reversal of 14212250052 is 25005221241.
It is not an unprimeable number, because it can be changed into a prime (14212250051) 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 95 ways as a sum of consecutive naturals, for example, 3829974 + ... + 3833682.
Almost surely, 214212250052 is an apocalyptic number.
14212250052 is a gapful number since it is divisible by the number (12) 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 14212250052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23210947200).
14212250052 is an abundant number, since it is smaller than the sum of its proper divisors (32209644348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14212250052 is a wasteful number, since it uses less digits than its factorization.
14212250052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787 (or 3774 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
Adding to 14212250052 its reverse (25005221241), we get a palindrome (39217471293).
The spelling of 14212250052 in words is "fourteen billion, two hundred twelve million, two hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •