Base | Representation |
---|---|
bin | 111000010110101101… |
… | …0101000100110000111 |
3 | 102120101011102212110221 |
4 | 1300231122220212013 |
5 | 3440322341303111 |
6 | 131332444525211 |
7 | 11513004606262 |
oct | 1605532504607 |
9 | 376334385427 |
10 | 121021041031 |
11 | 4736324a390 |
12 | 1b555850807 |
13 | b5488b0767 |
14 | 5c00badcd9 |
15 | 3234941371 |
hex | 1c2d6a8987 |
121021041031 has 16 divisors (see below), whose sum is σ = 133078756608. Its totient is φ = 109140408000.
The previous prime is 121021041007. The next prime is 121021041061. The reversal of 121021041031 is 130140120121.
It is a cyclic number.
It is not a de Polignac number, because 121021041031 - 29 = 121021040519 is a prime.
It is a super-2 number, since 2×1210210410312 (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 = 121021040996 and 121021041014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121021041061) 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, 2207806 + ... + 2261956.
It is an arithmetic number, because the mean of its divisors is an integer number (8317422288).
Almost surely, 2121021041031 is an apocalyptic number.
121021041031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121021041031 is a deficient number, since it is larger than the sum of its proper divisors (12057715577).
121021041031 is a wasteful number, since it uses less digits than its factorization.
121021041031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55782.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 121021041031 its reverse (130140120121), we get a palindrome (251161161152).
The spelling of 121021041031 in words is "one hundred twenty-one billion, twenty-one million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •