Base | Representation |
---|---|
bin | 100010010011010… |
… | …1110011011110011 |
3 | 2222012210222101212 |
4 | 1010212232123303 |
5 | 4324124033410 |
6 | 310113550335 |
7 | 40344233666 |
oct | 10446563363 |
9 | 2865728355 |
10 | 1151002355 |
11 | 540790118 |
12 | 2815753ab |
13 | 1545ca3a9 |
14 | acc176dd |
15 | 6b0acb05 |
hex | 449ae6f3 |
1151002355 has 4 divisors (see below), whose sum is σ = 1381202832. Its totient is φ = 920801880.
The previous prime is 1151002339. The next prime is 1151002361. The reversal of 1151002355 is 5532001511.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5532001511 = 53 ⋅104377387.
It is not a de Polignac number, because 1151002355 - 24 = 1151002339 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1151002355.
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 3 ways as a sum of consecutive naturals, for example, 115100231 + ... + 115100240.
It is an arithmetic number, because the mean of its divisors is an integer number (345300708).
Almost surely, 21151002355 is an apocalyptic number.
1151002355 is a deficient number, since it is larger than the sum of its proper divisors (230200477).
1151002355 is an equidigital number, since it uses as much as digits as its factorization.
1151002355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230200476.
The product of its (nonzero) digits is 750, while the sum is 23.
The square root of 1151002355 is about 33926.4256148507. The cubic root of 1151002355 is about 1047.9938580701.
Adding to 1151002355 its reverse (5532001511), we get a palindrome (6683003866).
The spelling of 1151002355 in words is "one billion, one hundred fifty-one million, two thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •