Base | Representation |
---|---|
bin | 10000010100001101111… |
… | …111100011111010001111 |
3 | 10222012001211112221220111 |
4 | 100110031333203322033 |
5 | 121332230113331343 |
6 | 2215025410100451 |
7 | 144001623131263 |
oct | 20241577437217 |
9 | 3865054487814 |
10 | 1121221230223 |
11 | 3a2564177396 |
12 | 16137287a727 |
13 | 8196649b733 |
14 | 3c3a5a480a3 |
15 | 1e273a4cc9d |
hex | 1050dfe3e8f |
1121221230223 has 16 divisors (see below), whose sum is σ = 1146621422592. Its totient is φ = 1096126668000.
The previous prime is 1121221230169. The next prime is 1121221230251. The reversal of 1121221230223 is 3220321221211.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121221230223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121221230194 and 1121221230203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121221230263) 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, 3921765 + ... + 4197937.
It is an arithmetic number, because the mean of its divisors is an integer number (71663838912).
Almost surely, 21121221230223 is an apocalyptic number.
1121221230223 is a deficient number, since it is larger than the sum of its proper divisors (25400192369).
1121221230223 is a wasteful number, since it uses less digits than its factorization.
1121221230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276726.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1121221230223 its reverse (3220321221211), we get a palindrome (4341542451434).
The spelling of 1121221230223 in words is "one trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •