Base | Representation |
---|---|
bin | 110110010011011… |
… | …001001101100100 |
3 | 2100111022022200110 |
4 | 312103121031210 |
5 | 3331212204133 |
6 | 230223013020 |
7 | 31401554100 |
oct | 6623311544 |
9 | 2314268613 |
10 | 911053668 |
11 | 4282a2118 |
12 | 21513a170 |
13 | 116996a15 |
14 | 88dd6900 |
15 | 54eb1c63 |
hex | 364d9364 |
911053668 has 144 divisors (see below), whose sum is σ = 2577297408. Its totient is φ = 249480000.
The previous prime is 911053639. The next prime is 911053679. The reversal of 911053668 is 866350119.
911053668 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2752263 + ... + 2752593.
Almost surely, 2911053668 is an apocalyptic number.
911053668 is a gapful number since it is divisible by the number (98) 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 911053668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1288648704).
911053668 is an abundant number, since it is smaller than the sum of its proper divisors (1666243740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
911053668 is a wasteful number, since it uses less digits than its factorization.
911053668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 534 (or 525 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 39.
The square root of 911053668 is about 30183.6655825630. The cubic root of 911053668 is about 969.4259784398.
The spelling of 911053668 in words is "nine hundred eleven million, fifty-three thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •