Base | Representation |
---|---|
bin | 100010001010000… |
… | …0110000000001000 |
3 | 2221212121211112110 |
4 | 1010110012000020 |
5 | 4321401240102 |
6 | 305421142320 |
7 | 40254562224 |
oct | 10424060010 |
9 | 2855554473 |
10 | 1146118152 |
11 | 538a54593 |
12 | 27b9ba9a0 |
13 | 1535aa22a |
14 | ac305784 |
15 | 6a94586c |
hex | 44506008 |
1146118152 has 64 divisors (see below), whose sum is σ = 3147264000. Its totient is φ = 346192704.
The previous prime is 1146118151. The next prime is 1146118153. The reversal of 1146118152 is 2518116411.
It is an interprime number because it is at equal distance from previous prime (1146118151) and next prime (1146118153).
It is not an unprimeable number, because it can be changed into a prime (1146118151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44152 + ... + 65127.
It is an arithmetic number, because the mean of its divisors is an integer number (49176000).
Almost surely, 21146118152 is an apocalyptic number.
1146118152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1146118152 is an abundant number, since it is smaller than the sum of its proper divisors (2001145848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1146118152 is a wasteful number, since it uses less digits than its factorization.
1146118152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109330 (or 109326 counting only the distinct ones).
The product of its digits is 1920, while the sum is 30.
The square root of 1146118152 is about 33854.3668084340. The cubic root of 1146118152 is about 1046.5093919411.
The spelling of 1146118152 in words is "one billion, one hundred forty-six million, one hundred eighteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •