Base | Representation |
---|---|
bin | 10000010011001011110… |
… | …001110010000101100111 |
3 | 10222002012102011222100100 |
4 | 100103023301302011213 |
5 | 121322441220301043 |
6 | 2214323243315143 |
7 | 143632243434000 |
oct | 20231361620547 |
9 | 3862172158310 |
10 | 1120110322023 |
11 | 3a2044091640 |
12 | 16110281bab3 |
13 | 8181a29b9c4 |
14 | 3c2dc2aa1a7 |
15 | 1e20b25ecd3 |
hex | 104cbc72167 |
1120110322023 has 96 divisors (see below), whose sum is σ = 2124734976000. Its totient is φ = 563104785600.
The previous prime is 1120110321997. The next prime is 1120110322061. The reversal of 1120110322023 is 3202230110211.
It is not a de Polignac number, because 1120110322023 - 26 = 1120110321959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1120110321987 and 1120110322005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1120110322063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 520633 + ... + 1584701.
It is an arithmetic number, because the mean of its divisors is an integer number (22132656000).
Almost surely, 21120110322023 is an apocalyptic number.
1120110322023 is a deficient number, since it is larger than the sum of its proper divisors (1004624653977).
1120110322023 is a wasteful number, since it uses less digits than its factorization.
1120110322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064138 (or 1064121 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1120110322023 its reverse (3202230110211), we get a palindrome (4322340432234).
The spelling of 1120110322023 in words is "one trillion, one hundred twenty billion, one hundred ten million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •