Base | Representation |
---|---|
bin | 100010011111001… |
… | …1000010110000010 |
3 | 2222122111000112121 |
4 | 1010332120112002 |
5 | 4332221001310 |
6 | 310454514454 |
7 | 40451031433 |
oct | 10476302602 |
9 | 2878430477 |
10 | 1157203330 |
11 | 544235a98 |
12 | 283665a2a |
13 | 15598b9ca |
14 | ad98d48a |
15 | 6b8d50da |
hex | 44f98582 |
1157203330 has 8 divisors (see below), whose sum is σ = 2082966012. Its totient is φ = 462881328.
The previous prime is 1157203319. The next prime is 1157203337. The reversal of 1157203330 is 333027511.
It can be written as a sum of positive squares in 2 ways, for example, as 1037935089 + 119268241 = 32217^2 + 10921^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×11572033303 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1157203295 and 1157203304.
It is not an unprimeable number, because it can be changed into a prime (1157203337) 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 3 ways as a sum of consecutive naturals, for example, 57860157 + ... + 57860176.
Almost surely, 21157203330 is an apocalyptic number.
1157203330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1157203330 is a deficient number, since it is larger than the sum of its proper divisors (925762682).
1157203330 is a wasteful number, since it uses less digits than its factorization.
1157203330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115720340.
The product of its (nonzero) digits is 1890, while the sum is 25.
The square root of 1157203330 is about 34017.6914266680. The cubic root of 1157203330 is about 1049.8724954773.
The spelling of 1157203330 in words is "one billion, one hundred fifty-seven million, two hundred three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •