Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …110010100001011111111 |
3 | 10220021011100012022210002 |
4 | 100001133112110023333 |
5 | 121020033444010101 |
6 | 2201502112504515 |
7 | 142360364506403 |
oct | 20013726241377 |
9 | 3807140168702 |
10 | 1101111313151 |
11 | 394a846a3013 |
12 | 15949bb4b13b |
13 | 7cab00ba415 |
14 | 3b418d0d103 |
15 | 1d99831dd6b |
hex | 1005f5942ff |
1101111313151 has 2 divisors, whose sum is σ = 1101111313152. Its totient is φ = 1101111313150.
The previous prime is 1101111313079. The next prime is 1101111313193. The reversal of 1101111313151 is 1513131111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101111313151 - 210 = 1101111312127 is a prime.
It is a super-2 number, since 2×11011113131512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101111313751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550555656575 + 550555656576.
It is an arithmetic number, because the mean of its divisors is an integer number (550555656576).
Almost surely, 21101111313151 is an apocalyptic number.
1101111313151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101111313151 is an equidigital number, since it uses as much as digits as its factorization.
1101111313151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45, while the sum is 20.
Adding to 1101111313151 its reverse (1513131111011), we get a palindrome (2614242424162).
The spelling of 1101111313151 in words is "one trillion, one hundred one billion, one hundred eleven million, three hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •