Base | Representation |
---|---|
bin | 1001000010110011000… |
… | …1011101111110000000 |
3 | 112212001000001011111211 |
4 | 2100230301131332000 |
5 | 10021144204103333 |
6 | 155213114015504 |
7 | 14140133051566 |
oct | 2205461357600 |
9 | 485030034454 |
10 | 155369987968 |
11 | 5a98a342638 |
12 | 26141117594 |
13 | 11860c72030 |
14 | 773ca43a36 |
15 | 409526becd |
hex | 242cc5df80 |
155369987968 has 256 divisors, whose sum is σ = 356905180800. Its totient is φ = 66842689536.
The previous prime is 155369987959. The next prime is 155369988017. The reversal of 155369987968 is 869789963551.
It is a super-2 number, since 2×1553699879682 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155369987894 and 155369987903.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 308886405 + ... + 308886907.
Almost surely, 2155369987968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 155369987968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178452590400).
155369987968 is an abundant number, since it is smaller than the sum of its proper divisors (201535192832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155369987968 is a wasteful number, since it uses less digits than its factorization.
155369987968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769 (or 757 counting only the distinct ones).
The product of its digits is 881798400, while the sum is 76.
The spelling of 155369987968 in words is "one hundred fifty-five billion, three hundred sixty-nine million, nine hundred eighty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •