Base | Representation |
---|---|
bin | 10000001100110101111… |
… | …010101010100111011111 |
3 | 10221102121212102201010222 |
4 | 100030311322222213133 |
5 | 121220020040213043 |
6 | 2211235442151555 |
7 | 143301432135506 |
oct | 20146572524737 |
9 | 3842555381128 |
10 | 1113301101023 |
11 | 39a16a4a2071 |
12 | 15b9223525bb |
13 | 80ca3671c57 |
14 | 3bc53c1183d |
15 | 1de5d57cd68 |
hex | 10335eaa9df |
1113301101023 has 2 divisors, whose sum is σ = 1113301101024. Its totient is φ = 1113301101022.
The previous prime is 1113301100887. The next prime is 1113301101041. The reversal of 1113301101023 is 3201011033111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113301101023 - 216 = 1113301035487 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113301100992 and 1113301101010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113301101823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556650550511 + 556650550512.
It is an arithmetic number, because the mean of its divisors is an integer number (556650550512).
Almost surely, 21113301101023 is an apocalyptic number.
1113301101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113301101023 is an equidigital number, since it uses as much as digits as its factorization.
1113301101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1113301101023 its reverse (3201011033111), we get a palindrome (4314312134134).
The spelling of 1113301101023 in words is "one trillion, one hundred thirteen billion, three hundred one million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •