Base | Representation |
---|---|
bin | 1101010100110111011111… |
… | …0111111101001111110000 |
3 | 1220212201202011001100200201 |
4 | 3111031313313331033300 |
5 | 3410030043004313034 |
6 | 51055034033124544 |
7 | 3041403542130415 |
oct | 325156767751760 |
9 | 56781664040621 |
10 | 14652144604144 |
11 | 4739a37715053 |
12 | 17878256b9754 |
13 | 8238caa583b8 |
14 | 38924bbc010c |
15 | 1a6208a39014 |
hex | d5377dfd3f0 |
14652144604144 has 10 divisors (see below), whose sum is σ = 28388530170560. Its totient is φ = 7326072302064.
The previous prime is 14652144604133. The next prime is 14652144604219. The reversal of 14652144604144 is 44140644125641.
It is a super-2 number, since 2×146521446041442 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14652144604094 and 14652144604103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 457879518864 + ... + 457879518895.
It is an arithmetic number, because the mean of its divisors is an integer number (2838853017056).
Almost surely, 214652144604144 is an apocalyptic number.
It is an amenable number.
14652144604144 is a deficient number, since it is larger than the sum of its proper divisors (13736385566416).
14652144604144 is an equidigital number, since it uses as much as digits as its factorization.
14652144604144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915759037767 (or 915759037761 counting only the distinct ones).
The product of its (nonzero) digits is 1474560, while the sum is 46.
Adding to 14652144604144 its reverse (44140644125641), we get a palindrome (58792788729785).
The spelling of 14652144604144 in words is "fourteen trillion, six hundred fifty-two billion, one hundred forty-four million, six hundred four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •