Base | Representation |
---|---|
bin | 1100110000101010111100… |
… | …0100101100001100010100 |
3 | 1211200021122202112100011022 |
4 | 3030022233010230030110 |
5 | 3314333023402243444 |
6 | 45501233034300312 |
7 | 2645440631642645 |
oct | 314125704541424 |
9 | 54607582470138 |
10 | 14030300431124 |
11 | 451a242907aaa |
12 | 16a71bb287698 |
13 | 7aa089638133 |
14 | 3670da75d6cc |
15 | 194e610bd9ee |
hex | cc2af12c314 |
14030300431124 has 48 divisors (see below), whose sum is σ = 26092717963200. Its totient is φ = 6582526569216.
The previous prime is 14030300431109. The next prime is 14030300431127. The reversal of 14030300431124 is 42113400303041.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 14030300431093 and 14030300431102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14030300431127) 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 15 ways as a sum of consecutive naturals, for example, 3091622 + ... + 6133410.
It is an arithmetic number, because the mean of its divisors is an integer number (543598290900).
Almost surely, 214030300431124 is an apocalyptic number.
It is an amenable number.
14030300431124 is a deficient number, since it is larger than the sum of its proper divisors (12062417532076).
14030300431124 is a wasteful number, since it uses less digits than its factorization.
14030300431124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3042392 (or 3042390 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 14030300431124 its reverse (42113400303041), we get a palindrome (56143700734165).
The spelling of 14030300431124 in words is "fourteen trillion, thirty billion, three hundred million, four hundred thirty-one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •