Base | Representation |
---|---|
bin | 100000010001110… |
… | …0001110000110001 |
3 | 2210110221220100211 |
4 | 1000203201300301 |
5 | 4204230231103 |
6 | 255245344121 |
7 | 35560550125 |
oct | 10043416061 |
9 | 2713856324 |
10 | 1083055153 |
11 | 5063a1404 |
12 | 262868041 |
13 | 1434ca04b |
14 | a3bab585 |
15 | 6513a36d |
hex | 408e1c31 |
1083055153 has 8 divisors (see below), whose sum is σ = 1136943360. Its totient is φ = 1030351440.
The previous prime is 1083055121. The next prime is 1083055187. The reversal of 1083055153 is 3515503801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1083055153 - 25 = 1083055121 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1083055553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 294250 + ... + 297907.
It is an arithmetic number, because the mean of its divisors is an integer number (142117920).
Almost surely, 21083055153 is an apocalyptic number.
It is an amenable number.
1083055153 is a deficient number, since it is larger than the sum of its proper divisors (53888207).
1083055153 is an equidigital number, since it uses as much as digits as its factorization.
1083055153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592247.
The product of its (nonzero) digits is 9000, while the sum is 31.
The square root of 1083055153 is about 32909.8032962824. The cubic root of 1083055153 is about 1026.9521086881.
Adding to 1083055153 its reverse (3515503801), we get a palindrome (4598558954).
The spelling of 1083055153 in words is "one billion, eighty-three million, fifty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •