Base | Representation |
---|---|
bin | 1001000001010010010… |
… | …0011000000110110100 |
3 | 112210222200220220112010 |
4 | 2100110210120012310 |
5 | 10014331224343100 |
6 | 155104530124220 |
7 | 14124102304242 |
oct | 2202444300664 |
9 | 483880826463 |
10 | 154963902900 |
11 | 5a7a10a0944 |
12 | 26049120670 |
13 | 117c7aacb01 |
14 | 7700b37792 |
15 | 406e7a5750 |
hex | 24149181b4 |
154963902900 has 72 divisors (see below), whose sum is σ = 474736489920. Its totient is φ = 38892899840.
The previous prime is 154963902859. The next prime is 154963902959. The reversal of 154963902900 is 9209369451.
It is a super-2 number, since 2×1549639029002 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 154963902900.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15187440 + ... + 15197639.
It is an arithmetic number, because the mean of its divisors is an integer number (6593562360).
Almost surely, 2154963902900 is an apocalyptic number.
154963902900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
154963902900 is an abundant number, since it is smaller than the sum of its proper divisors (319772587020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154963902900 is a wasteful number, since it uses less digits than its factorization.
154963902900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30385113 (or 30385106 counting only the distinct ones).
The product of its (nonzero) digits is 524880, while the sum is 48.
The spelling of 154963902900 in words is "one hundred fifty-four billion, nine hundred sixty-three million, nine hundred two thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •