Base | Representation |
---|---|
bin | 10000010011001100011… |
… | …110110010111110001001 |
3 | 10222002020020101111001000 |
4 | 100103030132302332021 |
5 | 121323002230401441 |
6 | 2214324344245213 |
7 | 143632445641422 |
oct | 20231436627611 |
9 | 3862206344030 |
10 | 1120122122121 |
11 | 3a204a811192 |
12 | 161106770809 |
13 | 8181c870a02 |
14 | 3c2dda9c649 |
15 | 1e20c2e12b6 |
hex | 104cc7b2f89 |
1120122122121 has 16 divisors (see below), whose sum is σ = 1664222443200. Its totient is φ = 744596063424.
The previous prime is 1120122122099. The next prime is 1120122122209. The reversal of 1120122122121 is 1212212210211.
1120122122121 is a `hidden beast` number, since 1 + 1 + 201 + 221 + 221 + 21 = 666.
It is not a de Polignac number, because 1120122122121 - 25 = 1120122122089 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1120122122094 and 1120122122103.
It is not an unprimeable number, because it can be changed into a prime (1120122122221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59768736 + ... + 59787473.
It is an arithmetic number, because the mean of its divisors is an integer number (104013902700).
Almost surely, 21120122122121 is an apocalyptic number.
It is an amenable number.
1120122122121 is a deficient number, since it is larger than the sum of its proper divisors (544100321079).
1120122122121 is a wasteful number, since it uses less digits than its factorization.
1120122122121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119556565 (or 119556559 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1120122122121 its reverse (1212212210211), we get a palindrome (2332334332332).
The spelling of 1120122122121 in words is "one trillion, one hundred twenty billion, one hundred twenty-two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.245 sec. • engine limits •