Base | Representation |
---|---|
bin | 100000111011101… |
… | …1011101010111000 |
3 | 2212000100101000202 |
4 | 1001313123222320 |
5 | 4230343102141 |
6 | 301353021332 |
7 | 36245525660 |
oct | 10167335270 |
9 | 2760311022 |
10 | 1105050296 |
11 | 517854709 |
12 | 26a0b4848 |
13 | 147c2b61c |
14 | a6a951a0 |
15 | 6703249b |
hex | 41ddbab8 |
1105050296 has 32 divisors (see below), whose sum is σ = 2403315840. Its totient is φ = 466522848.
The previous prime is 1105050293. The next prime is 1105050299. The reversal of 1105050296 is 6920505011.
It is an interprime number because it is at equal distance from previous prime (1105050293) and next prime (1105050299).
It is a super-2 number, since 2×11050502962 = 2442272313379375232, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1105050293) 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 7 ways as a sum of consecutive naturals, for example, 143510 + ... + 151013.
It is an arithmetic number, because the mean of its divisors is an integer number (75103620).
Almost surely, 21105050296 is an apocalyptic number.
It is an amenable number.
1105050296 is an abundant number, since it is smaller than the sum of its proper divisors (1298265544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105050296 is a wasteful number, since it uses less digits than its factorization.
1105050296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294603 (or 294599 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 29.
The square root of 1105050296 is about 33242.2967918885. The cubic root of 1105050296 is about 1033.8574978803.
The spelling of 1105050296 in words is "one billion, one hundred five million, fifty thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •