Base | Representation |
---|---|
bin | 10010000100110100110… |
… | …110110110010101101001 |
3 | 11101202011100010211222001 |
4 | 102010310312312111221 |
5 | 130322341334421441 |
6 | 2350343330531001 |
7 | 155512124462506 |
oct | 22046466662551 |
9 | 4352140124861 |
10 | 1242132342121 |
11 | 439870363350 |
12 | 180897736a61 |
13 | 90195370168 |
14 | 44195da04ad |
15 | 2249d9c7731 |
hex | 12134db6569 |
1242132342121 has 16 divisors (see below), whose sum is σ = 1379245344768. Its totient is φ = 1109227392000.
The previous prime is 1242132342119. The next prime is 1242132342127. The reversal of 1242132342121 is 1212432312421.
It is a cyclic number.
It is not a de Polignac number, because 1242132342121 - 21 = 1242132342119 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1242132342121.
It is not an unprimeable number, because it can be changed into a prime (1242132342127) 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, 4260600 + ... + 4542793.
It is an arithmetic number, because the mean of its divisors is an integer number (86202834048).
Almost surely, 21242132342121 is an apocalyptic number.
1242132342121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1242132342121 is a deficient number, since it is larger than the sum of its proper divisors (137113002647).
1242132342121 is a wasteful number, since it uses less digits than its factorization.
1242132342121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8803632.
The product of its digits is 4608, while the sum is 28.
Adding to 1242132342121 its reverse (1212432312421), we get a palindrome (2454564654542).
The spelling of 1242132342121 in words is "one trillion, two hundred forty-two billion, one hundred thirty-two million, three hundred forty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •