Base | Representation |
---|---|
bin | 10000010100001111001… |
… | …000000001000111101001 |
3 | 10222012010011021221210100 |
4 | 100110033020001013221 |
5 | 121332244444133413 |
6 | 2215031325140013 |
7 | 144002243440353 |
oct | 20241710010751 |
9 | 3865104257710 |
10 | 1121240224233 |
11 | 3a257396a918 |
12 | 1613790ba609 |
13 | 8196a3bbcac |
14 | 3c3a83900d3 |
15 | 1e275550a73 |
hex | 1050f2011e9 |
1121240224233 has 12 divisors (see below), whose sum is σ = 1619816522688. Its totient is φ = 747379339800.
The previous prime is 1121240224217. The next prime is 1121240224243. The reversal of 1121240224233 is 3324220421211.
1121240224233 is a `hidden beast` number, since 1 + 1 + 2 + 1 + 2 + 402 + 24 + 233 = 666.
It is not a de Polignac number, because 1121240224233 - 24 = 1121240224217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121240224197 and 1121240224206.
It is not an unprimeable number, because it can be changed into a prime (1121240224213) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9449685 + ... + 9567602.
It is an arithmetic number, because the mean of its divisors is an integer number (134984710224).
Almost surely, 21121240224233 is an apocalyptic number.
It is an amenable number.
1121240224233 is a deficient number, since it is larger than the sum of its proper divisors (498576298455).
1121240224233 is a wasteful number, since it uses less digits than its factorization.
1121240224233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19023844 (or 19023841 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 1121240224233 its reverse (3324220421211), we get a palindrome (4445460645444).
The spelling of 1121240224233 in words is "one trillion, one hundred twenty-one billion, two hundred forty million, two hundred twenty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •