Base | Representation |
---|---|
bin | 100000110100111… |
… | …1011000001111010 |
3 | 2211202200102220122 |
4 | 1001221323001322 |
5 | 4223441234410 |
6 | 301145053242 |
7 | 36203445500 |
oct | 10151730172 |
9 | 2752612818 |
10 | 1101508730 |
11 | 5158558a3 |
12 | 268a87222 |
13 | 14728b61a |
14 | a6412670 |
15 | 66a82e55 |
hex | 41a7b07a |
1101508730 has 24 divisors (see below), whose sum is σ = 2306425428. Its totient is φ = 377659968.
The previous prime is 1101508729. The next prime is 1101508741. The reversal of 1101508730 is 378051011.
1101508730 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 999761161 + 101747569 = 31619^2 + 10087^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1101508730.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1123499 + ... + 1124478.
Almost surely, 21101508730 is an apocalyptic number.
1101508730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101508730 is an abundant number, since it is smaller than the sum of its proper divisors (1204916698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101508730 is a wasteful number, since it uses less digits than its factorization.
1101508730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2247998 (or 2247991 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 26.
The square root of 1101508730 is about 33188.9850703513. The cubic root of 1101508730 is about 1032.7518489342.
Adding to 1101508730 its reverse (378051011), we get a palindrome (1479559741).
The spelling of 1101508730 in words is "one billion, one hundred one million, five hundred eight thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •