Base | Representation |
---|---|
bin | 10011000101001… |
… | …000101000000000 |
3 | 211022100102200200 |
4 | 103011020220000 |
5 | 1123422110102 |
6 | 51433045200 |
7 | 10634626332 |
oct | 2305105000 |
9 | 738312620 |
10 | 320113152 |
11 | 154771827 |
12 | 8b256800 |
13 | 51420888 |
14 | 3072b452 |
15 | 1d18351c |
hex | 13148a00 |
320113152 has 120 divisors (see below), whose sum is σ = 932845056. Its totient is φ = 105670656.
The previous prime is 320113151. The next prime is 320113169. The reversal of 320113152 is 251311023.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (320113151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 584943 + ... + 585489.
Almost surely, 2320113152 is an apocalyptic number.
320113152 is a gapful number since it is divisible by the number (32) 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 320113152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (466422528).
320113152 is an abundant number, since it is smaller than the sum of its proper divisors (612731904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320113152 is a wasteful number, since it uses less digits than its factorization.
320113152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 698 (or 679 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 320113152 is about 17891.7062350129. The cubic root of 320113152 is about 684.0709888361.
Adding to 320113152 its reverse (251311023), we get a palindrome (571424175).
The spelling of 320113152 in words is "three hundred twenty million, one hundred thirteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •