Base | Representation |
---|---|
bin | 10011010110110000110… |
… | …011010000001011111001 |
3 | 11201011020201201211202022 |
4 | 103112300303100023321 |
5 | 133243031421320441 |
6 | 2455013345244225 |
7 | 165045251655530 |
oct | 23266063201371 |
9 | 4634221654668 |
10 | 1330111120121 |
11 | 473108062433 |
12 | 19594b633675 |
13 | 985764c7694 |
14 | 4854067b317 |
15 | 248ec69d84b |
hex | 135b0cd02f9 |
1330111120121 has 16 divisors (see below), whose sum is σ = 1557171686400. Its totient is φ = 1112369439888.
The previous prime is 1330111120103. The next prime is 1330111120139. The reversal of 1330111120121 is 1210211110331.
It is an interprime number because it is at equal distance from previous prime (1330111120103) and next prime (1330111120139).
It is not a de Polignac number, because 1330111120121 - 210 = 1330111119097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1330111120121.
It is not an unprimeable number, because it can be changed into a prime (1330111120621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2127611 + ... + 2680848.
It is an arithmetic number, because the mean of its divisors is an integer number (97323230400).
Almost surely, 21330111120121 is an apocalyptic number.
It is an amenable number.
1330111120121 is a deficient number, since it is larger than the sum of its proper divisors (227060566279).
1330111120121 is an equidigital number, since it uses as much as digits as its factorization.
1330111120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4809428.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1330111120121 its reverse (1210211110331), we get a palindrome (2540322230452).
The spelling of 1330111120121 in words is "one trillion, three hundred thirty billion, one hundred eleven million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •