Base | Representation |
---|---|
bin | 11011000100001110… |
… | …11101110100110000 |
3 | 1101111200200121121110 |
4 | 31202013131310300 |
5 | 214224420314344 |
6 | 10401522153320 |
7 | 1023043453641 |
oct | 154207356460 |
9 | 41450617543 |
10 | 14531026224 |
11 | 6187427090 |
12 | 29964b2840 |
13 | 14a7638090 |
14 | 9bbc276c8 |
15 | 5a0a793b9 |
hex | 3621ddd30 |
14531026224 has 80 divisors (see below), whose sum is σ = 44101177344. Its totient is φ = 4064620800.
The previous prime is 14531026151. The next prime is 14531026229. The reversal of 14531026224 is 42262013541.
14531026224 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×145310262242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14531026191 and 14531026200.
It is not an unprimeable number, because it can be changed into a prime (14531026229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1051632 + ... + 1065359.
Almost surely, 214531026224 is an apocalyptic number.
It is an amenable number.
14531026224 is an abundant number, since it is smaller than the sum of its proper divisors (29570151120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14531026224 is a wasteful number, since it uses less digits than its factorization.
14531026224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2117026 (or 2117020 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 14531026224 its reverse (42262013541), we get a palindrome (56793039765).
The spelling of 14531026224 in words is "fourteen billion, five hundred thirty-one million, twenty-six thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •