Base | Representation |
---|---|
bin | 1101000111011000011010… |
… | …0011010110110100111000 |
3 | 1220001120201211112112112002 |
4 | 3101312012203112310320 |
5 | 3342231101413100102 |
6 | 50400400304240132 |
7 | 3015562335621440 |
oct | 321660643266470 |
9 | 56046654475462 |
10 | 14420462628152 |
11 | 465a758238419 |
12 | 174a947910048 |
13 | 807ac7a68789 |
14 | 37bd50141120 |
15 | 1a0198e97902 |
hex | d1d868d6d38 |
14420462628152 has 32 divisors (see below), whose sum is σ = 30901113408000. Its totient is φ = 6180173856864.
The previous prime is 14420462628119. The next prime is 14420462628157. The reversal of 14420462628152 is 25182626402441.
14420462628152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14420462628097 and 14420462628106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14420462628157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26305349 + ... + 26847947.
It is an arithmetic number, because the mean of its divisors is an integer number (965659794000).
Almost surely, 214420462628152 is an apocalyptic number.
It is an amenable number.
14420462628152 is an abundant number, since it is smaller than the sum of its proper divisors (16480650779848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14420462628152 is a wasteful number, since it uses less digits than its factorization.
14420462628152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017195 (or 1017191 counting only the distinct ones).
The product of its (nonzero) digits is 1474560, while the sum is 47.
The spelling of 14420462628152 in words is "fourteen trillion, four hundred twenty billion, four hundred sixty-two million, six hundred twenty-eight thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •