Base | Representation |
---|---|
bin | 100001011010010… |
… | …1110111101111011 |
3 | 2220010120210200112 |
4 | 1002310232331323 |
5 | 4244001320443 |
6 | 303125254535 |
7 | 36532235534 |
oct | 10264567573 |
9 | 2803523615 |
10 | 1121120123 |
11 | 525930162 |
12 | 27356444b |
13 | 14b366bb6 |
14 | a8c7968b |
15 | 68658b18 |
hex | 42d2ef7b |
1121120123 has 4 divisors (see below), whose sum is σ = 1147192728. Its totient is φ = 1095047520.
The previous prime is 1121120111. The next prime is 1121120129. The reversal of 1121120123 is 3210211211.
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 1121120123 - 24 = 1121120107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121120098 and 1121120107.
It is not an unprimeable number, because it can be changed into a prime (1121120129) 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 3 ways as a sum of consecutive naturals, for example, 13036238 + ... + 13036323.
It is an arithmetic number, because the mean of its divisors is an integer number (286798182).
Almost surely, 21121120123 is an apocalyptic number.
1121120123 is a deficient number, since it is larger than the sum of its proper divisors (26072605).
1121120123 is an equidigital number, since it uses as much as digits as its factorization.
1121120123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26072604.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1121120123 is about 33483.1319174297. The cubic root of 1121120123 is about 1038.8449093101.
Adding to 1121120123 its reverse (3210211211), we get a palindrome (4331331334).
The spelling of 1121120123 in words is "one billion, one hundred twenty-one million, one hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •