Base | Representation |
---|---|
bin | 1001000011101101110… |
… | …0011001001010110000 |
3 | 112212200011012001021022 |
4 | 2100323130121022300 |
5 | 10022200211342040 |
6 | 155253345315012 |
7 | 14146212131246 |
oct | 2207334311260 |
9 | 485604161238 |
10 | 155616121520 |
11 | 5aaa62753a2 |
12 | 261ab635a68 |
13 | 1189cc5c8a2 |
14 | 77635d4796 |
15 | 40abb8a6b5 |
hex | 243b7192b0 |
155616121520 has 40 divisors (see below), whose sum is σ = 361854879984. Its totient is φ = 62238294272.
The previous prime is 155616121511. The next prime is 155616121607. The reversal of 155616121520 is 25121616551.
155616121520 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×1556161215202 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506687 + ... + 753633.
Almost surely, 2155616121520 is an apocalyptic number.
155616121520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
155616121520 is an abundant number, since it is smaller than the sum of its proper divisors (206238758464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155616121520 is a wasteful number, since it uses less digits than its factorization.
155616121520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254837 (or 254831 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 35.
The spelling of 155616121520 in words is "one hundred fifty-five billion, six hundred sixteen million, one hundred twenty-one thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •