Base | Representation |
---|---|
bin | 10000010101001110011… |
… | …111000111001111010111 |
3 | 10222021212020112220201001 |
4 | 100111032133013033113 |
5 | 121341434112240343 |
6 | 2215325021244131 |
7 | 144040502111161 |
oct | 20251637071727 |
9 | 3867766486631 |
10 | 1122303243223 |
11 | 3a2a69a16808 |
12 | 161615103647 |
13 | 81aa96c2306 |
14 | 3c469623931 |
15 | 1e2d8a2e44d |
hex | 1054e7c73d7 |
1122303243223 has 16 divisors (see below), whose sum is σ = 1173859433856. Its totient is φ = 1072115066880.
The previous prime is 1122303243211. The next prime is 1122303243239. The reversal of 1122303243223 is 3223423032211.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1122303243223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1122303243191 and 1122303243200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122303243283) 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 in 15 ways as a sum of consecutive naturals, for example, 686448 + ... + 1647973.
It is an arithmetic number, because the mean of its divisors is an integer number (73366214616).
Almost surely, 21122303243223 is an apocalyptic number.
1122303243223 is a deficient number, since it is larger than the sum of its proper divisors (51556190633).
1122303243223 is a wasteful number, since it uses less digits than its factorization.
1122303243223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2334714.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 1122303243223 its reverse (3223423032211), we get a palindrome (4345726275434).
The spelling of 1122303243223 in words is "one trillion, one hundred twenty-two billion, three hundred three million, two hundred forty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •