Base | Representation |
---|---|
bin | 10000001010101110100… |
… | …011001011110110011011 |
3 | 10221012202120222220202201 |
4 | 100022232203023312123 |
5 | 121200342141142111 |
6 | 2210222233111031 |
7 | 143161234235503 |
oct | 20125643136633 |
9 | 3835676886681 |
10 | 1111030021531 |
11 | 399204534471 |
12 | 15b3a9858477 |
13 | 80a00cb4631 |
14 | 3baba350a03 |
15 | 1dd78ec06c1 |
hex | 102ae8cbd9b |
1111030021531 has 2 divisors, whose sum is σ = 1111030021532. Its totient is φ = 1111030021530.
The previous prime is 1111030021481. The next prime is 1111030021547. The reversal of 1111030021531 is 1351200301111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1111030021531 - 29 = 1111030021019 is a prime.
It is a super-2 number, since 2×11110300215312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1111030021499 and 1111030021508.
It is not a weakly prime, because it can be changed into another prime (1111030021631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555515010765 + 555515010766.
It is an arithmetic number, because the mean of its divisors is an integer number (555515010766).
Almost surely, 21111030021531 is an apocalyptic number.
1111030021531 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111030021531 is an equidigital number, since it uses as much as digits as its factorization.
1111030021531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 19.
Adding to 1111030021531 its reverse (1351200301111), we get a palindrome (2462230322642).
The spelling of 1111030021531 in words is "one trillion, one hundred eleven billion, thirty million, twenty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •