Base | Representation |
---|---|
bin | 1000110110100111111… |
… | …1010010100111000000 |
3 | 112112121020211221022212 |
4 | 2031221333102213000 |
5 | 4443001111214321 |
6 | 153512534521252 |
7 | 13663142062361 |
oct | 2155177224700 |
9 | 475536757285 |
10 | 152102054336 |
11 | 5956270a741 |
12 | 2558a806228 |
13 | 1145cc093ab |
14 | 750ca13b68 |
15 | 3e5340055b |
hex | 2369fd29c0 |
152102054336 has 28 divisors (see below), whose sum is σ = 301947559680. Its totient is φ = 76020779520.
The previous prime is 152102054333. The next prime is 152102054347. The reversal of 152102054336 is 633450201251.
It is a happy number.
152102054336 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152102054333) 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 3 ways as a sum of consecutive naturals, for example, 310016 + ... + 632703.
Almost surely, 2152102054336 is an apocalyptic number.
152102054336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
152102054336 is a deficient number, since it is larger than the sum of its proper divisors (149845505344).
152102054336 is an equidigital number, since it uses as much as digits as its factorization.
152102054336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945252 (or 945242 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 152102054336 its reverse (633450201251), we get a palindrome (785552255587).
The spelling of 152102054336 in words is "one hundred fifty-two billion, one hundred two million, fifty-four thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •