Base | Representation |
---|---|
bin | 100010100000101… |
… | …1000101111101000 |
3 | 2222200222001120101 |
4 | 1011001120233220 |
5 | 4332421211100 |
6 | 310523435144 |
7 | 40460523136 |
oct | 10501305750 |
9 | 2880861511 |
10 | 1157991400 |
11 | 544724095 |
12 | 283985ab4 |
13 | 155ba6617 |
14 | adb16756 |
15 | 6b9dd86a |
hex | 45058be8 |
1157991400 has 24 divisors (see below), whose sum is σ = 2692330470. Its totient is φ = 463196480.
The previous prime is 1157991383. The next prime is 1157991409. The reversal of 1157991400 is 41997511.
It can be written as a sum of positive squares in 3 ways, for example, as 838797444 + 319193956 = 28962^2 + 17866^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1157991400.
It is not an unprimeable number, because it can be changed into a prime (1157991409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2894779 + ... + 2895178.
Almost surely, 21157991400 is an apocalyptic number.
1157991400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1157991400 is an abundant number, since it is smaller than the sum of its proper divisors (1534339070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1157991400 is a wasteful number, since it uses less digits than its factorization.
1157991400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5789973 (or 5789964 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 37.
The square root of 1157991400 is about 34029.2726927861. The cubic root of 1157991400 is about 1050.1107668482.
The spelling of 1157991400 in words is "one billion, one hundred fifty-seven million, nine hundred ninety-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.378 sec. • engine limits •