Base | Representation |
---|---|
bin | 1000110110011101111… |
… | …1101110001000110010 |
3 | 112112111100010201222000 |
4 | 2031213133232020302 |
5 | 4442404404132200 |
6 | 153504442154430 |
7 | 13662123402240 |
oct | 2154737561062 |
9 | 475440121860 |
10 | 152060224050 |
11 | 59541039a59 |
12 | 255787b2a16 |
13 | 11454351747 |
14 | 7507245790 |
15 | 3e4e8db300 |
hex | 23677ee232 |
152060224050 has 192 divisors, whose sum is σ = 479369318400. Its totient is φ = 34720315200.
The previous prime is 152060224049. The next prime is 152060224081. The reversal of 152060224050 is 50422060251.
152060224050 is a `hidden beast` number, since 1 + 5 + 2 + 0 + 602 + 2 + 4 + 0 + 50 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 9621655 + ... + 9637445.
It is an arithmetic number, because the mean of its divisors is an integer number (2496715200).
Almost surely, 2152060224050 is an apocalyptic number.
152060224050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 152060224050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (239684659200).
152060224050 is an abundant number, since it is smaller than the sum of its proper divisors (327309094350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152060224050 is a wasteful number, since it uses less digits than its factorization.
152060224050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16838 (or 16827 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 152060224050 in words is "one hundred fifty-two billion, sixty million, two hundred twenty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •