Base | Representation |
---|---|
bin | 100111000100101… |
… | …1110111101100000 |
3 | 10101101002020101010 |
4 | 1032021132331200 |
5 | 10141120441320 |
6 | 334033340520 |
7 | 44330146050 |
oct | 11611367540 |
9 | 3341066333 |
10 | 1311108960 |
11 | 6130a5627 |
12 | 307107740 |
13 | 17b827525 |
14 | c61b3560 |
15 | 7a186ae0 |
hex | 4e25ef60 |
1311108960 has 96 divisors (see below), whose sum is σ = 4720004352. Its totient is φ = 299681280.
The previous prime is 1311108943. The next prime is 1311108983. The reversal of 1311108960 is 698011131.
1311108960 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191746 + ... + 198465.
It is an arithmetic number, because the mean of its divisors is an integer number (49166712).
Almost surely, 21311108960 is an apocalyptic number.
1311108960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1311108960 is an abundant number, since it is smaller than the sum of its proper divisors (3408895392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311108960 is a wasteful number, since it uses less digits than its factorization.
1311108960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390236 (or 390228 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 30.
The square root of 1311108960 is about 36209.2386001142. The cubic root of 1311108960 is about 1094.4928491126.
The spelling of 1311108960 in words is "one billion, three hundred eleven million, one hundred eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •