Base | Representation |
---|---|
bin | 11011110001110000… |
… | …11001011101000100 |
3 | 1102111022100110110110 |
4 | 31320320121131010 |
5 | 221020203432012 |
6 | 10503444153020 |
7 | 1035362000361 |
oct | 157070313504 |
9 | 42438313413 |
10 | 14912952132 |
11 | 6362a77731 |
12 | 2a82398770 |
13 | 15387bba40 |
14 | a16845468 |
15 | 5c436c73c |
hex | 378e19744 |
14912952132 has 48 divisors (see below), whose sum is σ = 38682409472. Its totient is φ = 4440579840.
The previous prime is 14912952113. The next prime is 14912952133. The reversal of 14912952132 is 23125921941.
14912952132 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×149129521322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (14912952133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1537033 + ... + 1546704.
Almost surely, 214912952132 is an apocalyptic number.
14912952132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14912952132 is an abundant number, since it is smaller than the sum of its proper divisors (23769457340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14912952132 is a wasteful number, since it uses less digits than its factorization.
14912952132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3083788 (or 3083786 counting only the distinct ones).
The product of its digits is 38880, while the sum is 39.
The spelling of 14912952132 in words is "fourteen billion, nine hundred twelve million, nine hundred fifty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •