Base | Representation |
---|---|
bin | 10010111100100101010… |
… | …100011010111111010111 |
3 | 11121110200200222000001211 |
4 | 102330211110122333113 |
5 | 132312444301413421 |
6 | 2434044152202251 |
7 | 163031542415062 |
oct | 22744524327727 |
9 | 4543620860054 |
10 | 1302001201111 |
11 | 4621a280a206 |
12 | 190405699387 |
13 | 95a168a2400 |
14 | 470352778d9 |
15 | 23d049739e1 |
hex | 12f2551afd7 |
1302001201111 has 6 divisors (see below), whose sum is σ = 1409859288960. Its totient is φ = 1201847262408.
The previous prime is 1302001201063. The next prime is 1302001201121. The reversal of 1302001201111 is 1111021002031.
It is a happy number.
It is not a de Polignac number, because 1302001201111 - 211 = 1302001199063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1302001201091 and 1302001201100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302001201121) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3852074391 + ... + 3852074728.
It is an arithmetic number, because the mean of its divisors is an integer number (234976548160).
Almost surely, 21302001201111 is an apocalyptic number.
1302001201111 is a deficient number, since it is larger than the sum of its proper divisors (107858087849).
1302001201111 is an equidigital number, since it uses as much as digits as its factorization.
1302001201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7704149145 (or 7704149132 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1302001201111 its reverse (1111021002031), we get a palindrome (2413022203142).
The spelling of 1302001201111 in words is "one trillion, three hundred two billion, one million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •