Base | Representation |
---|---|
bin | 100000111011101… |
… | …1010000100010010 |
3 | 2212000100001000120 |
4 | 1001313122010102 |
5 | 4230342344410 |
6 | 301352531110 |
7 | 36245500560 |
oct | 10167320422 |
9 | 2760301016 |
10 | 1105043730 |
11 | 51784a78a |
12 | 26a0b0a96 |
13 | 147c2863b |
14 | a6a92a30 |
15 | 67030570 |
hex | 41dda112 |
1105043730 has 64 divisors (see below), whose sum is σ = 3076254720. Its totient is φ = 248808384.
The previous prime is 1105043711. The next prime is 1105043761. The reversal of 1105043730 is 373405011.
It is a super-2 number, since 2×11050437302 = 2442243290424625800, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1105043730.
It is an unprimeable number.
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, 25200 + ... + 53339.
It is an arithmetic number, because the mean of its divisors is an integer number (48066480).
Almost surely, 21105043730 is an apocalyptic number.
1105043730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1105043730 is an abundant number, since it is smaller than the sum of its proper divisors (1971210990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1105043730 is a wasteful number, since it uses less digits than its factorization.
1105043730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78623.
The product of its (nonzero) digits is 1260, while the sum is 24.
The square root of 1105043730 is about 33242.1980320195. The cubic root of 1105043730 is about 1033.8554502143.
Adding to 1105043730 its reverse (373405011), we get a palindrome (1478448741).
The spelling of 1105043730 in words is "one billion, one hundred five million, forty-three thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •