Base | Representation |
---|---|
bin | 111000010111010101… |
… | …1011100000101000111 |
3 | 102120102122022001021021 |
4 | 1300232223130011013 |
5 | 3440343302122211 |
6 | 131334522532011 |
7 | 11513352631453 |
oct | 1605653340507 |
9 | 376378261237 |
10 | 121042223431 |
11 | 473741a7aa8 |
12 | 1b560967007 |
13 | b5500b911c |
14 | 5c03925663 |
15 | 3236727771 |
hex | 1c2eadc147 |
121042223431 has 16 divisors (see below), whose sum is σ = 124424035200. Its totient is φ = 117707984928.
The previous prime is 121042223429. The next prime is 121042223453. The reversal of 121042223431 is 134322240121.
It is not a de Polignac number, because 121042223431 - 21 = 121042223429 is a prime.
It is a super-2 number, since 2×1210422234312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121042223396 and 121042223405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121042223531) 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 15 ways as a sum of consecutive naturals, for example, 4462396 + ... + 4489438.
It is an arithmetic number, because the mean of its divisors is an integer number (7776502200).
Almost surely, 2121042223431 is an apocalyptic number.
121042223431 is a deficient number, since it is larger than the sum of its proper divisors (3381811769).
121042223431 is a wasteful number, since it uses less digits than its factorization.
121042223431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27918.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 121042223431 its reverse (134322240121), we get a palindrome (255364463552).
The spelling of 121042223431 in words is "one hundred twenty-one billion, forty-two million, two hundred twenty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •