Base | Representation |
---|---|
bin | 100010010011110… |
… | …0111111101110000 |
3 | 2222020020221122110 |
4 | 1010213213331300 |
5 | 4324204104000 |
6 | 310123005320 |
7 | 40346235003 |
oct | 10447477560 |
9 | 2866227573 |
10 | 1151238000 |
11 | 540931170 |
12 | 281669840 |
13 | 154680723 |
14 | acc7953a |
15 | 6b107850 |
hex | 449e7f70 |
1151238000 has 160 divisors (see below), whose sum is σ = 4049240832. Its totient is φ = 279072000.
The previous prime is 1151237999. The next prime is 1151238037. The reversal of 1151238000 is 8321511.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57279 + ... + 74721.
Almost surely, 21151238000 is an apocalyptic number.
1151238000 is a gapful number since it is divisible by the number (10) 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 1151238000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2024620416).
1151238000 is an abundant number, since it is smaller than the sum of its proper divisors (2898002832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1151238000 is a wasteful number, since it uses less digits than its factorization.
1151238000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17480 (or 17464 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 1151238000 is about 33929.8983199184. The cubic root of 1151238000 is about 1048.0653718715.
Adding to 1151238000 its reverse (8321511), we get a palindrome (1159559511).
The spelling of 1151238000 in words is "one billion, one hundred fifty-one million, two hundred thirty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •