Base | Representation |
---|---|
bin | 11011000100011000… |
… | …01000100111000010 |
3 | 1101111202222210101100 |
4 | 31202030020213002 |
5 | 214230224000200 |
6 | 10402004315230 |
7 | 1023060041643 |
oct | 154214104702 |
9 | 41452883340 |
10 | 14532250050 |
11 | 618809260a |
12 | 29969a2b16 |
13 | 14a7976136 |
14 | 9bc0656ca |
15 | 5a0c1bd00 |
hex | 3623089c2 |
14532250050 has 72 divisors (see below), whose sum is σ = 39513814704. Its totient is φ = 3828566880.
The previous prime is 14532250049. The next prime is 14532250093. The reversal of 14532250050 is 5005223541.
It is a happy number.
It is a super-2 number, since 2×145322500502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14532249996 and 14532250023.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 157192 + ... + 231891.
It is an arithmetic number, because the mean of its divisors is an integer number (548802982).
Almost surely, 214532250050 is an apocalyptic number.
14532250050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14532250050 is an abundant number, since it is smaller than the sum of its proper divisors (24981564654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14532250050 is a wasteful number, since it uses less digits than its factorization.
14532250050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389184 (or 389176 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
Adding to 14532250050 its reverse (5005223541), we get a palindrome (19537473591).
The spelling of 14532250050 in words is "fourteen billion, five hundred thirty-two million, two hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •