Base | Representation |
---|---|
bin | 11011000100001001… |
… | …10100000111110101 |
3 | 1101111122101022010001 |
4 | 31202010310013311 |
5 | 214224231044000 |
6 | 10401455231301 |
7 | 1023034530262 |
oct | 154204640765 |
9 | 41448338101 |
10 | 14530331125 |
11 | 6186aa1922 |
12 | 2996218531 |
13 | 14a745388b |
14 | 9bbac6269 |
15 | 5a098d46a |
hex | 3621341f5 |
14530331125 has 16 divisors (see below), whose sum is σ = 18157926384. Its totient is φ = 11608833600.
The previous prime is 14530331117. The next prime is 14530331143. The reversal of 14530331125 is 52113303541.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 690690961 + 13839640164 = 26281^2 + 117642^2 .
It is not a de Polignac number, because 14530331125 - 23 = 14530331117 is a prime.
It is a super-2 number, since 2×145303311252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14530331093 and 14530331102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17847 + ... + 171403.
It is an arithmetic number, because the mean of its divisors is an integer number (1134870399).
Almost surely, 214530331125 is an apocalyptic number.
It is an amenable number.
14530331125 is a deficient number, since it is larger than the sum of its proper divisors (3627595259).
14530331125 is an equidigital number, since it uses as much as digits as its factorization.
14530331125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154329 (or 154319 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 14530331125 its reverse (52113303541), we get a palindrome (66643634666).
The spelling of 14530331125 in words is "fourteen billion, five hundred thirty million, three hundred thirty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •