Base | Representation |
---|---|
bin | 100000110011011… |
… | …0010110001010100 |
3 | 2211201010202201120 |
4 | 1001212302301110 |
5 | 4223234012333 |
6 | 301115323540 |
7 | 36163461165 |
oct | 10146626124 |
9 | 2751122646 |
10 | 1100688468 |
11 | 5153455a0 |
12 | 2687505b0 |
13 | 147062169 |
14 | a627b76c |
15 | 6696edb3 |
hex | 419b2c54 |
1100688468 has 96 divisors (see below), whose sum is σ = 2958144000. Its totient is φ = 315031680.
The previous prime is 1100688467. The next prime is 1100688493. The reversal of 1100688468 is 8648860011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100688461) 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, 1552098 + ... + 1552806.
It is an arithmetic number, because the mean of its divisors is an integer number (30814000).
Almost surely, 21100688468 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1100688468, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1479072000).
1100688468 is an abundant number, since it is smaller than the sum of its proper divisors (1857455532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100688468 is a wasteful number, since it uses less digits than its factorization.
1100688468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365 (or 1363 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 42.
The square root of 1100688468 is about 33176.6253256717. The cubic root of 1100688468 is about 1032.4954317015.
The spelling of 1100688468 in words is "one billion, one hundred million, six hundred eighty-eight thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •