Base | Representation |
---|---|
bin | 1001000011000101111… |
… | …0101000011001101000 |
3 | 112212020111121010220111 |
4 | 2100301132220121220 |
5 | 10021324411423130 |
6 | 155225014104104 |
7 | 14142112104106 |
oct | 2206136503150 |
9 | 485214533814 |
10 | 155448936040 |
11 | 5aa1a965482 |
12 | 2616364b034 |
13 | 11874424678 |
14 | 7749314c76 |
15 | 409c16402a |
hex | 24317a8668 |
155448936040 has 64 divisors (see below), whose sum is σ = 354859425360. Its totient is φ = 61274511360.
The previous prime is 155448936023. The next prime is 155448936043. The reversal of 155448936040 is 40639844551.
It can be written as a sum of positive squares in 8 ways, for example, as 114488843044 + 40960092996 = 338362^2 + 202386^2 .
It is not an unprimeable number, because it can be changed into a prime (155448936043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3425982 + ... + 3471058.
Almost surely, 2155448936040 is an apocalyptic number.
155448936040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 155448936040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177429712680).
155448936040 is an abundant number, since it is smaller than the sum of its proper divisors (199410489320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155448936040 is a wasteful number, since it uses less digits than its factorization.
155448936040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46342 (or 46338 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 49.
The spelling of 155448936040 in words is "one hundred fifty-five billion, four hundred forty-eight million, nine hundred thirty-six thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •