Base | Representation |
---|---|
bin | 10000000011100100001… |
… | …101011000010000000111 |
3 | 10220110220200111122002121 |
4 | 100003210031120100013 |
5 | 121034120111341411 |
6 | 2202511220350411 |
7 | 142466542102543 |
oct | 20034415302007 |
9 | 3813820448077 |
10 | 1103340340231 |
11 | 395a18949058 |
12 | 159a02545407 |
13 | 80076b42c5c |
14 | 3b58ad84a23 |
15 | 1da78d71571 |
hex | 100e4358407 |
1103340340231 has 2 divisors, whose sum is σ = 1103340340232. Its totient is φ = 1103340340230.
The previous prime is 1103340340177. The next prime is 1103340340253. The reversal of 1103340340231 is 1320430433011.
It is a strong prime.
It is an emirp because it is prime and its reverse (1320430433011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1103340340231 - 27 = 1103340340103 is a prime.
It is a super-2 number, since 2×11033403402312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1103340340196 and 1103340340205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1103340340261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551670170115 + 551670170116.
It is an arithmetic number, because the mean of its divisors is an integer number (551670170116).
Almost surely, 21103340340231 is an apocalyptic number.
1103340340231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103340340231 is an equidigital number, since it uses as much as digits as its factorization.
1103340340231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1103340340231 its reverse (1320430433011), we get a palindrome (2423770773242).
The spelling of 1103340340231 in words is "one trillion, one hundred three billion, three hundred forty million, three hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •