Base | Representation |
---|---|
bin | 100010011110111… |
… | …0000111111100111 |
3 | 2222122011211110000 |
4 | 1010331300333213 |
5 | 4332200322101 |
6 | 310451232343 |
7 | 40446460506 |
oct | 10475607747 |
9 | 2878154400 |
10 | 1157042151 |
11 | 544135991 |
12 | 2835a86b3 |
13 | 155933535 |
14 | ad94a83d |
15 | 6b8a2486 |
hex | 44f70fe7 |
1157042151 has 40 divisors (see below), whose sum is σ = 1872748944. Its totient is φ = 709067520.
The previous prime is 1157042147. The next prime is 1157042153. The reversal of 1157042151 is 1512407511.
1157042151 is a `hidden beast` number, since 1 + 1 + 570 + 42 + 1 + 51 = 666.
It is not a de Polignac number, because 1157042151 - 22 = 1157042147 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1157042153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 49441 + ... + 68981.
Almost surely, 21157042151 is an apocalyptic number.
1157042151 is a deficient number, since it is larger than the sum of its proper divisors (715706793).
1157042151 is a wasteful number, since it uses less digits than its factorization.
1157042151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19613 (or 19604 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
The square root of 1157042151 is about 34015.3222974588. The cubic root of 1157042151 is about 1049.8237500087.
Adding to 1157042151 its reverse (1512407511), we get a palindrome (2669449662).
It can be divided in two parts, 115704 and 2151, that added together give a triangular number (117855 = T485).
The spelling of 1157042151 in words is "one billion, one hundred fifty-seven million, forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •