Base | Representation |
---|---|
bin | 110101101111101… |
… | …0001101110000100 |
3 | 11122200100020102221 |
4 | 1223133101232010 |
5 | 12143130024111 |
6 | 454540142124 |
7 | 62455213462 |
oct | 15337215604 |
9 | 4580306387 |
10 | 1803361156 |
11 | 845a4aa23 |
12 | 423b37944 |
13 | 2297c8c0c |
14 | 13170d832 |
15 | a84be371 |
hex | 6b7d1b84 |
1803361156 has 27 divisors (see below), whose sum is σ = 3355128399. Its totient is φ = 847961088.
The previous prime is 1803361127. The next prime is 1803361159. The reversal of 1803361156 is 6511633081.
The square root of 1803361156 is 42466.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 74132100 + 1729229056 = 8610^2 + 41584^2 .
It is a super-2 number, since 2×18033611562 = 6504222917939312672, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1803361159) by changing a digit.
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 8 ways as a sum of consecutive naturals, for example, 1443220 + ... + 1444468.
Almost surely, 21803361156 is an apocalyptic number.
1803361156 is the 42466-th square number.
It is an amenable number.
1803361156 is a deficient number, since it is larger than the sum of its proper divisors (1551767243).
1803361156 is an equidigital number, since it uses as much as digits as its factorization.
1803361156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536 (or 1268 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 34.
The cubic root of 1803361156 is about 1217.1970849779.
The spelling of 1803361156 in words is "one billion, eight hundred three million, three hundred sixty-one thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •