Base | Representation |
---|---|
bin | 101111101101110… |
… | …0101000011000000 |
3 | 11010120200112111100 |
4 | 1133123211003000 |
5 | 11234333041102 |
6 | 422512214400 |
7 | 54450554301 |
oct | 13733450300 |
9 | 4116615440 |
10 | 1601065152 |
11 | 751839a45 |
12 | 38823a400 |
13 | 1c691983b |
14 | 1128d07a8 |
15 | 9585ea1c |
hex | 5f6e50c0 |
1601065152 has 84 divisors (see below), whose sum is σ = 4686885216. Its totient is φ = 522324480.
The previous prime is 1601065133. The next prime is 1601065183. The reversal of 1601065152 is 2515601061.
It is a happy number.
1601065152 is a `hidden beast` number, since 1 + 6 + 0 + 1 + 0 + 651 + 5 + 2 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2499 + ... + 56642.
Almost surely, 21601065152 is an apocalyptic number.
1601065152 is a gapful number since it is divisible by the number (12) 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 1601065152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2343442608).
1601065152 is an abundant number, since it is smaller than the sum of its proper divisors (3085820064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1601065152 is a wasteful number, since it uses less digits than its factorization.
1601065152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59206 (or 59193 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 1601065152 is about 40013.3121848217. The cubic root of 1601065152 is about 1169.8665813238.
The spelling of 1601065152 in words is "one billion, six hundred one million, sixty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •