Base | Representation |
---|---|
bin | 1001000011110110000… |
… | …0010110001001011000 |
3 | 112212202120021102200211 |
4 | 2100331200112021120 |
5 | 10022233040242102 |
6 | 155301022540504 |
7 | 14150112136465 |
oct | 2207540261130 |
9 | 485676242624 |
10 | 155650712152 |
11 | 600138508a1 |
12 | 261bb137734 |
13 | 118a7181210 |
14 | 776803a66c |
15 | 40aec1e7d7 |
hex | 243d816258 |
155650712152 has 16 divisors (see below), whose sum is σ = 314294707440. Its totient is φ = 71838790176.
The previous prime is 155650712137. The next prime is 155650712167. The reversal of 155650712152 is 251217056551.
It is an interprime number because it is at equal distance from previous prime (155650712137) and next prime (155650712167).
It is a super-2 number, since 2×1556507121522 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 748320628 + ... + 748320835.
It is an arithmetic number, because the mean of its divisors is an integer number (19643419215).
Almost surely, 2155650712152 is an apocalyptic number.
It is an amenable number.
155650712152 is an abundant number, since it is smaller than the sum of its proper divisors (158643995288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155650712152 is a wasteful number, since it uses less digits than its factorization.
155650712152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1496641482 (or 1496641478 counting only the distinct ones).
The product of its (nonzero) digits is 105000, while the sum is 40.
The spelling of 155650712152 in words is "one hundred fifty-five billion, six hundred fifty million, seven hundred twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •