Base | Representation |
---|---|
bin | 1010000010000101101101… |
… | …1100000111010111111111 |
3 | 1110001112222001122122020222 |
4 | 2200201123130013113333 |
5 | 2421213002042104043 |
6 | 35243324233531555 |
7 | 2215651466613155 |
oct | 240413334072777 |
9 | 43045861578228 |
10 | 11031010113023 |
11 | 35732526a389a |
12 | 12a1a72b73bbb |
13 | 6202b1b57464 |
14 | 2a1c91c013d5 |
15 | 141e1dd10d68 |
hex | a085b7075ff |
11031010113023 has 2 divisors, whose sum is σ = 11031010113024. Its totient is φ = 11031010113022.
The previous prime is 11031010112929. The next prime is 11031010113031. The reversal of 11031010113023 is 32031101013011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11031010113023 - 210 = 11031010111999 is a prime.
It is a super-3 number, since 3×110310101130233 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 11031010112992 and 11031010113010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031010113043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515505056511 + 5515505056512.
It is an arithmetic number, because the mean of its divisors is an integer number (5515505056512).
Almost surely, 211031010113023 is an apocalyptic number.
11031010113023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031010113023 is an equidigital number, since it uses as much as digits as its factorization.
11031010113023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11031010113023 its reverse (32031101013011), we get a palindrome (43062111126034).
The spelling of 11031010113023 in words is "eleven trillion, thirty-one billion, ten million, one hundred thirteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •