Base | Representation |
---|---|
bin | 10000010011011101001… |
… | …011101000111100110011 |
3 | 10222002221202121122200101 |
4 | 100103131023220330303 |
5 | 121324040443004021 |
6 | 2214412233533231 |
7 | 143642420345452 |
oct | 20233513507463 |
9 | 3862852548611 |
10 | 1120402313011 |
11 | 3a2183995803 |
12 | 161184574217 |
13 | 81865924237 |
14 | 3c328d96b99 |
15 | 1e226bdaa91 |
hex | 104dd2e8f33 |
1120402313011 has 2 divisors, whose sum is σ = 1120402313012. Its totient is φ = 1120402313010.
The previous prime is 1120402312963. The next prime is 1120402313033. The reversal of 1120402313011 is 1103132040211.
It is a strong prime.
It is an emirp because it is prime and its reverse (1103132040211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120402313011 is a prime.
It is a super-2 number, since 2×11204023130112 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1120402313011.
It is not a weakly prime, because it can be changed into another prime (1120402313071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560201156505 + 560201156506.
It is an arithmetic number, because the mean of its divisors is an integer number (560201156506).
Almost surely, 21120402313011 is an apocalyptic number.
1120402313011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120402313011 is an equidigital number, since it uses as much as digits as its factorization.
1120402313011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1120402313011 its reverse (1103132040211), we get a palindrome (2223534353222).
The spelling of 1120402313011 in words is "one trillion, one hundred twenty billion, four hundred two million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •