Base | Representation |
---|---|
bin | 100000110111010… |
… | …1010000111000001 |
3 | 2211212000111210222 |
4 | 1001232222013001 |
5 | 4224301001040 |
6 | 301231432425 |
7 | 36220136000 |
oct | 10156520701 |
9 | 2755014728 |
10 | 1102750145 |
11 | 516523562 |
12 | 269385715 |
13 | 1476046a3 |
14 | a6656c37 |
15 | 66c2abb5 |
hex | 41baa1c1 |
1102750145 has 32 divisors (see below), whose sum is σ = 1580947200. Its totient is φ = 737681280.
The previous prime is 1102750141. The next prime is 1102750147. The reversal of 1102750145 is 5410572011.
It is not a de Polignac number, because 1102750145 - 22 = 1102750141 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1102750141) 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 31 ways as a sum of consecutive naturals, for example, 62474 + ... + 78156.
It is an arithmetic number, because the mean of its divisors is an integer number (49404600).
Almost surely, 21102750145 is an apocalyptic number.
It is an amenable number.
1102750145 is a deficient number, since it is larger than the sum of its proper divisors (478197055).
1102750145 is an equidigital number, since it uses as much as digits as its factorization.
1102750145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15750 (or 15736 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 26.
The square root of 1102750145 is about 33207.6820178705. The cubic root of 1102750145 is about 1033.1396783010.
The spelling of 1102750145 in words is "one billion, one hundred two million, seven hundred fifty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •