Base | Representation |
---|---|
bin | 100010001010000… |
… | …0111101001000100 |
3 | 2221212122011202012 |
4 | 1010110013221010 |
5 | 4321401443433 |
6 | 305421233352 |
7 | 40254620630 |
oct | 10424075104 |
9 | 2855564665 |
10 | 1146124868 |
11 | 538a59639 |
12 | 27ba02858 |
13 | 1535b02c5 |
14 | ac307dc0 |
15 | 6a947848 |
hex | 44507a44 |
1146124868 has 48 divisors (see below), whose sum is σ = 2399464704. Its totient is φ = 468357120.
The previous prime is 1146124867. The next prime is 1146124949. The reversal of 1146124868 is 8684216411.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1146124867) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 214388 + ... + 219668.
It is an arithmetic number, because the mean of its divisors is an integer number (49988848).
Almost surely, 21146124868 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 1146124868, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1199732352).
1146124868 is an abundant number, since it is smaller than the sum of its proper divisors (1253339836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1146124868 is a wasteful number, since it uses less digits than its factorization.
1146124868 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5652 (or 5650 counting only the distinct ones).
The product of its digits is 73728, while the sum is 41.
The square root of 1146124868 is about 33854.4659978562. The cubic root of 1146124868 is about 1046.5114360420.
The spelling of 1146124868 in words is "one billion, one hundred forty-six million, one hundred twenty-four thousand, eight hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •