Base | Representation |
---|---|
bin | 100010001110110… |
… | …1110010101101000 |
3 | 2222001101002111220 |
4 | 1010131232111220 |
5 | 4323023031124 |
6 | 305551222040 |
7 | 40315205301 |
oct | 10435562550 |
9 | 2861332456 |
10 | 1148642664 |
11 | 53a419264 |
12 | 280817920 |
13 | 153c82320 |
14 | ac7a17a8 |
15 | 6ac93879 |
hex | 4476e568 |
1148642664 has 64 divisors (see below), whose sum is σ = 3103665600. Its totient is φ = 352152576.
The previous prime is 1148642657. The next prime is 1148642687. The reversal of 1148642664 is 4662468411.
It is a happy number.
It is a super-2 number, since 2×11486426642 = 2638759939122033792, which contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81792 + ... + 94800.
It is an arithmetic number, because the mean of its divisors is an integer number (48494775).
Almost surely, 21148642664 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 1148642664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1551832800).
1148642664 is an abundant number, since it is smaller than the sum of its proper divisors (1955022936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1148642664 is a wasteful number, since it uses less digits than its factorization.
1148642664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13314 (or 13310 counting only the distinct ones).
The product of its digits is 221184, while the sum is 42.
The square root of 1148642664 is about 33891.6311793929. The cubic root of 1148642664 is about 1047.2771976356.
The spelling of 1148642664 in words is "one billion, one hundred forty-eight million, six hundred forty-two thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •