Base | Representation |
---|---|
bin | 10010100011001… |
… | …00010010100000 |
3 | 101211210022010011 |
4 | 21101210102200 |
5 | 304313200112 |
6 | 23235014304 |
7 | 3566402260 |
oct | 1121442240 |
9 | 354708104 |
10 | 155600032 |
11 | 7a917675 |
12 | 4413a394 |
13 | 2630cb33 |
14 | 169457a0 |
15 | d9d8aa7 |
hex | 94644a0 |
155600032 has 48 divisors (see below), whose sum is σ = 351050112. Its totient is φ = 66504960.
The previous prime is 155600023. The next prime is 155600047. The reversal of 155600032 is 230006551.
It is a happy number.
It is a super-2 number, since 2×1556000322 = 48422739916802048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 155599976 and 155600012.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111982 + ... + 113362.
It is an arithmetic number, because the mean of its divisors is an integer number (7313544).
Almost surely, 2155600032 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 155600032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175525056).
155600032 is an abundant number, since it is smaller than the sum of its proper divisors (195450080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155600032 is a wasteful number, since it uses less digits than its factorization.
155600032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1901 (or 1893 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 155600032 is about 12473.9741862808. The cubic root of 155600032 is about 537.8608006259.
Adding to 155600032 its reverse (230006551), we get a palindrome (385606583).
The spelling of 155600032 in words is "one hundred fifty-five million, six hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.041 sec. • engine limits •