Base | Representation |
---|---|
bin | 10110101000101001… |
… | …10000010100000000 |
3 | 1011100220101221021002 |
4 | 23110110300110000 |
5 | 144341422121102 |
6 | 5325502351132 |
7 | 610066346420 |
oct | 132424602400 |
9 | 34326357232 |
10 | 12152145152 |
11 | 5176629574 |
12 | 243188b4a8 |
13 | 11b8834c44 |
14 | 833d04480 |
15 | 4b1cc5902 |
hex | 2d4530500 |
12152145152 has 144 divisors (see below), whose sum is σ = 28847871360. Its totient is φ = 4998733824.
The previous prime is 12152145143. The next prime is 12152145157. The reversal of 12152145152 is 25154125121.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12152145157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10237103 + ... + 10238289.
It is an arithmetic number, because the mean of its divisors is an integer number (200332440).
Almost surely, 212152145152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12152145152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14423935680).
12152145152 is an abundant number, since it is smaller than the sum of its proper divisors (16695726208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12152145152 is a wasteful number, since it uses less digits than its factorization.
12152145152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1436 (or 1422 counting only the distinct ones).
The product of its digits is 4000, while the sum is 29.
The spelling of 12152145152 in words is "twelve billion, one hundred fifty-two million, one hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •