Base | Representation |
---|---|
bin | 1001000011111001001… |
… | …0100111011111000000 |
3 | 112212210111001221210220 |
4 | 2100332102213133000 |
5 | 10022244423442433 |
6 | 155302213223040 |
7 | 14150332144110 |
oct | 2207622473700 |
9 | 485714057726 |
10 | 155663890368 |
11 | 60020231888 |
12 | 26203631a80 |
13 | 118a9b1658c |
14 | 7769aab040 |
15 | 40b0e742b3 |
hex | 243e4a77c0 |
155663890368 has 224 divisors, whose sum is σ = 479565004800. Its totient is φ = 43644496896.
The previous prime is 155663890367. The next prime is 155663890379. The reversal of 155663890368 is 863098366551.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (224).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (155663890367) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17727003 + ... + 17735781.
It is an arithmetic number, because the mean of its divisors is an integer number (2140915200).
Almost surely, 2155663890368 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 155663890368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (239782502400).
155663890368 is an abundant number, since it is smaller than the sum of its proper divisors (323901114432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155663890368 is a wasteful number, since it uses less digits than its factorization.
155663890368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9047 (or 9037 counting only the distinct ones).
The product of its (nonzero) digits is 27993600, while the sum is 60.
The spelling of 155663890368 in words is "one hundred fifty-five billion, six hundred sixty-three million, eight hundred ninety thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •