Base | Representation |
---|---|
bin | 100111010101101… |
… | …1100010101110001 |
3 | 10101222211111211210 |
4 | 1032223130111301 |
5 | 10200410323441 |
6 | 334552230333 |
7 | 44465623632 |
oct | 11653342561 |
9 | 3358744753 |
10 | 1320011121 |
11 | 618125990 |
12 | 30a09b3a9 |
13 | 180623490 |
14 | c744d889 |
15 | 7ad44616 |
hex | 4eadc571 |
1320011121 has 64 divisors (see below), whose sum is σ = 2236502016. Its totient is φ = 680064000.
The previous prime is 1320011107. The next prime is 1320011191. The reversal of 1320011121 is 1211100231.
It is not a de Polignac number, because 1320011121 - 226 = 1252902257 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1320011097 and 1320011106.
It is not an unprimeable number, because it can be changed into a prime (1320011191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 340846 + ... + 344696.
It is an arithmetic number, because the mean of its divisors is an integer number (34945344).
Almost surely, 21320011121 is an apocalyptic number.
1320011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1320011121 is a deficient number, since it is larger than the sum of its proper divisors (916490895).
1320011121 is a wasteful number, since it uses less digits than its factorization.
1320011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3942.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 1320011121 is about 36331.9572965729. The cubic root of 1320011121 is about 1096.9643911109.
Adding to 1320011121 its reverse (1211100231), we get a palindrome (2531111352).
The spelling of 1320011121 in words is "one billion, three hundred twenty million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •