Base | Representation |
---|---|
bin | 100001011010100… |
… | …1001110100101001 |
3 | 2220010210101120112 |
4 | 1002311021310221 |
5 | 4244013330441 |
6 | 303131504105 |
7 | 36533204324 |
oct | 10265116451 |
9 | 2803711515 |
10 | 1121230121 |
11 | 5259a5870 |
12 | 2735b8035 |
13 | 14b3a4c9b |
14 | a8ca77bb |
15 | 6867b4eb |
hex | 42d49d29 |
1121230121 has 16 divisors (see below), whose sum is σ = 1299654720. Its totient is φ = 959295040.
The previous prime is 1121230111. The next prime is 1121230133. The reversal of 1121230121 is 1210321211.
It is a de Polignac number, because none of the positive numbers 2k-1121230121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1121230096 and 1121230105.
It is not an unprimeable number, because it can be changed into a prime (1121230111) 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, 43670 + ... + 64416.
It is an arithmetic number, because the mean of its divisors is an integer number (81228420).
Almost surely, 21121230121 is an apocalyptic number.
1121230121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1121230121 is a deficient number, since it is larger than the sum of its proper divisors (178424599).
1121230121 is an equidigital number, since it uses as much as digits as its factorization.
1121230121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20809 (or 20775 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1121230121 is about 33484.7744654194. The cubic root of 1121230121 is about 1038.8788834053.
Adding to 1121230121 its reverse (1210321211), we get a palindrome (2331551332).
The spelling of 1121230121 in words is "one billion, one hundred twenty-one million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •