Base | Representation |
---|---|
bin | 100110110011100… |
… | …1010001110010001 |
3 | 10100202011002122211 |
4 | 1031213022032101 |
5 | 10131320023441 |
6 | 333112432121 |
7 | 44160522223 |
oct | 11547121621 |
9 | 3322132584 |
10 | 1302111121 |
11 | 60900a3a3 |
12 | 3040a8641 |
13 | 1799c6b6c |
14 | c4d10413 |
15 | 794aaa81 |
hex | 4d9ca391 |
1302111121 has 4 divisors (see below), whose sum is σ = 1358724672. Its totient is φ = 1245497572.
The previous prime is 1302111119. The next prime is 1302111133. The reversal of 1302111121 is 1211112031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1302111121 - 21 = 1302111119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1302111521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28306741 + ... + 28306786.
It is an arithmetic number, because the mean of its divisors is an integer number (339681168).
Almost surely, 21302111121 is an apocalyptic number.
It is an amenable number.
1302111121 is a deficient number, since it is larger than the sum of its proper divisors (56613551).
1302111121 is an equidigital number, since it uses as much as digits as its factorization.
1302111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56613550.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 1302111121 is about 36084.7768595013. The cubic root of 1302111121 is about 1091.9833487892.
Adding to 1302111121 its reverse (1211112031), we get a palindrome (2513223152).
It can be divided in two parts, 13021 and 11121, that added together give a palindrome (24142).
The spelling of 1302111121 in words is "one billion, three hundred two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •