Base | Representation |
---|---|
bin | 11011100000111100010010… |
… | …010100110111010010011111 |
3 | 120212110112120102101102210100 |
4 | 123200330102110313102133 |
5 | 111330121022310232111 |
6 | 1105211405131512143 |
7 | 34326520443122112 |
oct | 3340742224672237 |
9 | 525415512342710 |
10 | 121011011024031 |
11 | 35615532a77467 |
12 | 116a48b28b8653 |
13 | 526a39b9ac83b |
14 | 21c4d6da16579 |
15 | decb928d7756 |
hex | 6e0f1253749f |
121011011024031 has 12 divisors (see below), whose sum is σ = 175040218117960. Its totient is φ = 80560221721200.
The previous prime is 121011011024021. The next prime is 121011011024077. The reversal of 121011011024031 is 130420110110121.
It is not a de Polignac number, because 121011011024031 - 215 = 121011010991263 is a prime.
It is a super-2 number, since 2×1210110110240312 (a number of 29 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 = 121011011023995 and 121011011024013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121011011024021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9482128945 + ... + 9482141706.
Almost surely, 2121011011024031 is an apocalyptic number.
121011011024031 is a deficient number, since it is larger than the sum of its proper divisors (54029207093929).
121011011024031 is a wasteful number, since it uses less digits than its factorization.
121011011024031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18964271366 (or 18964271363 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 121011011024031 its reverse (130420110110121), we get a palindrome (251431121134152).
The spelling of 121011011024031 in words is "one hundred twenty-one trillion, eleven billion, eleven million, twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •