Base | Representation |
---|---|
bin | 100000111000100… |
… | …0011001010101100 |
3 | 2211220012100210100 |
4 | 1001301003022230 |
5 | 4224431031233 |
6 | 301253111100 |
7 | 36225356523 |
oct | 10161031254 |
9 | 2756170710 |
10 | 1103377068 |
11 | 516911582 |
12 | 269628490 |
13 | 147793b51 |
14 | a677b4ba |
15 | 66d01813 |
hex | 41c432ac |
1103377068 has 72 divisors (see below), whose sum is σ = 2915404128. Its totient is φ = 351191808.
The previous prime is 1103377057. The next prime is 1103377073. The reversal of 1103377068 is 8607733011.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 924280 + ... + 925472.
It is an arithmetic number, because the mean of its divisors is an integer number (40491724).
Almost surely, 21103377068 is an apocalyptic number.
1103377068 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1103377068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1457702064).
1103377068 is an abundant number, since it is smaller than the sum of its proper divisors (1812027060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103377068 is a wasteful number, since it uses less digits than its factorization.
1103377068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2343 (or 2338 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 36.
The square root of 1103377068 is about 33217.1201039464. The cubic root of 1103377068 is about 1033.3354241604.
The spelling of 1103377068 in words is "one billion, one hundred three million, three hundred seventy-seven thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •