Base | Representation |
---|---|
bin | 1101000100000111011101… |
… | …0011001100001011011110 |
3 | 1212212012221210102101100011 |
4 | 3101001313103030023132 |
5 | 3340321213233012100 |
6 | 50314522414553434 |
7 | 3011535350523451 |
oct | 321016723141336 |
9 | 55765853371304 |
10 | 14364372157150 |
11 | 4638994671364 |
12 | 173bab320887a |
13 | 802729274872 |
14 | 37934c9b1498 |
15 | 19d9b4a98bba |
hex | d10774cc2de |
14364372157150 has 48 divisors (see below), whose sum is σ = 26775704995200. Its totient is φ = 5733283583360.
The previous prime is 14364372157147. The next prime is 14364372157169. The reversal of 14364372157150 is 5175127346341.
14364372157150 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×143643721571502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14364372157094 and 14364372157103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 538119204 + ... + 538145896.
It is an arithmetic number, because the mean of its divisors is an integer number (557827187400).
Almost surely, 214364372157150 is an apocalyptic number.
14364372157150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14364372157150 is a deficient number, since it is larger than the sum of its proper divisors (12411332838050).
14364372157150 is a wasteful number, since it uses less digits than its factorization.
14364372157150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49653 (or 49648 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 49.
The spelling of 14364372157150 in words is "fourteen trillion, three hundred sixty-four billion, three hundred seventy-two million, one hundred fifty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •