Base | Representation |
---|---|
bin | 10000010100010011010… |
… | …111001111001110001111 |
3 | 10222012022010002010222212 |
4 | 100110103113033032033 |
5 | 121332421144314043 |
6 | 2215042345101035 |
7 | 144004065661433 |
oct | 20242327171617 |
9 | 3865263063885 |
10 | 1121311323023 |
11 | 3a2600011451 |
12 | 161398a8777b |
13 | 8197c053998 |
14 | 3c3b39ba9c3 |
15 | 1e27b8e7018 |
hex | 105135cf38f |
1121311323023 has 4 divisors (see below), whose sum is σ = 1124524249800. Its totient is φ = 1118098396248.
The previous prime is 1121311322987. The next prime is 1121311323043. The reversal of 1121311323023 is 3203231131211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1121311323023 - 212 = 1121311318927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121311323023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121311323043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1606462865 + ... + 1606463562.
It is an arithmetic number, because the mean of its divisors is an integer number (281131062450).
Almost surely, 21121311323023 is an apocalyptic number.
1121311323023 is a deficient number, since it is larger than the sum of its proper divisors (3212926777).
1121311323023 is an equidigital number, since it uses as much as digits as its factorization.
1121311323023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212926776.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1121311323023 its reverse (3203231131211), we get a palindrome (4324542454234).
The spelling of 1121311323023 in words is "one trillion, one hundred twenty-one billion, three hundred eleven million, three hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •