Base | Representation |
---|---|
bin | 1000111000000111110… |
… | …1011011111011110110 |
3 | 112120122021121010212102 |
4 | 2032001331123323312 |
5 | 4444312040041210 |
6 | 154020502422102 |
7 | 14006124331241 |
oct | 2160175337366 |
9 | 476567533772 |
10 | 152504221430 |
11 | 59749725840 |
12 | 25681431932 |
13 | 114c53291a2 |
14 | 754a1c0258 |
15 | 3e78890ea5 |
hex | 2381f5bef6 |
152504221430 has 64 divisors (see below), whose sum is σ = 315428325120. Its totient is φ = 52503292800.
The previous prime is 152504221393. The next prime is 152504221433. The reversal of 152504221430 is 34122405251.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 152504221393 and 152504221402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152504221433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3314885 + ... + 3360575.
It is an arithmetic number, because the mean of its divisors is an integer number (4928567580).
Almost surely, 2152504221430 is an apocalyptic number.
152504221430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
152504221430 is an abundant number, since it is smaller than the sum of its proper divisors (162924103690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152504221430 is a wasteful number, since it uses less digits than its factorization.
152504221430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47325.
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 152504221430 its reverse (34122405251), we get a palindrome (186626626681).
The spelling of 152504221430 in words is "one hundred fifty-two billion, five hundred four million, two hundred twenty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •