Base | Representation |
---|---|
bin | 11011010001101000… |
… | …01111011101000000 |
3 | 1101210112012011200012 |
4 | 31220310033131000 |
5 | 214442204132021 |
6 | 10421015244052 |
7 | 1025610035252 |
oct | 155064173500 |
9 | 41715164605 |
10 | 14643427136 |
11 | 62349185a8 |
12 | 2a08079628 |
13 | 14c4a011b0 |
14 | 9ccb25cd2 |
15 | 5aa87d35b |
hex | 368d0f740 |
14643427136 has 28 divisors (see below), whose sum is σ = 31293287172. Its totient is φ = 6758504448.
The previous prime is 14643427109. The next prime is 14643427159. The reversal of 14643427136 is 63172434641.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 6376980736 + 8266446400 = 79856^2 + 90920^2 .
It is a super-4 number, since 4×146434271364 (a number of 42 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14643427093 and 14643427102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8799305 + ... + 8800968.
It is an arithmetic number, because the mean of its divisors is an integer number (1117617399).
Almost surely, 214643427136 is an apocalyptic number.
14643427136 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
14643427136 is an abundant number, since it is smaller than the sum of its proper divisors (16649860036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14643427136 is a wasteful number, since it uses less digits than its factorization.
14643427136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17600298 (or 17600288 counting only the distinct ones).
The product of its digits is 290304, while the sum is 41.
The spelling of 14643427136 in words is "fourteen billion, six hundred forty-three million, four hundred twenty-seven thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •