Base | Representation |
---|---|
bin | 10111101101010101… |
… | …01101010000011110 |
3 | 1012212001120220122000 |
4 | 23312222231100132 |
5 | 202031422401100 |
6 | 5503004103130 |
7 | 630263656452 |
oct | 136652552036 |
9 | 35761526560 |
10 | 12728325150 |
11 | 5441898092 |
12 | 2572834aa6 |
13 | 127b010758 |
14 | 88a64a662 |
15 | 4e768a900 |
hex | 2f6aad41e |
12728325150 has 96 divisors (see below), whose sum is σ = 36919660800. Its totient is φ = 3215570400.
The previous prime is 12728325139. The next prime is 12728325157. The reversal of 12728325150 is 5152382721.
12728325150 is a `hidden beast` number, since 127 + 283 + 251 + 5 + 0 = 666.
It is a super-2 number, since 2×127283251502 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12728325157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 222466 + ... + 273765.
It is an arithmetic number, because the mean of its divisors is an integer number (384579800).
Almost surely, 212728325150 is an apocalyptic number.
12728325150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12728325150 is an abundant number, since it is smaller than the sum of its proper divisors (24191335650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12728325150 is a wasteful number, since it uses less digits than its factorization.
12728325150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496271 (or 496260 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The spelling of 12728325150 in words is "twelve billion, seven hundred twenty-eight million, three hundred twenty-five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •