Base | Representation |
---|---|
bin | 11011100001010000111000… |
… | …001100111111001111001001 |
3 | 120212112122122022211100202220 |
4 | 123201100320030333033021 |
5 | 111331001313030030441 |
6 | 1105225503124244253 |
7 | 34331232401455650 |
oct | 3341207014771711 |
9 | 525478568740686 |
10 | 121033121330121 |
11 | 35623949733700 |
12 | 116a9043540689 |
13 | 526c4b36432b0 |
14 | 21c606a2ac197 |
15 | ded538a54466 |
hex | 6e143833f3c9 |
121033121330121 has 96 divisors (see below), whose sum is σ = 218517061238784. Its totient is φ = 57984450480000.
The previous prime is 121033121330117. The next prime is 121033121330123.
121033121330121 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 121033121330121 - 22 = 121033121330117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121033121330091 and 121033121330100.
It is not an unprimeable number, because it can be changed into a prime (121033121330123) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34221496 + ... + 37592246.
It is an arithmetic number, because the mean of its divisors is an integer number (2276219387904).
Almost surely, 2121033121330121 is an apocalyptic number.
121033121330121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121033121330121 is a deficient number, since it is larger than the sum of its proper divisors (97483939908663).
121033121330121 is a wasteful number, since it uses less digits than its factorization.
121033121330121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3371883 (or 3371872 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The spelling of 121033121330121 in words is "one hundred twenty-one trillion, thirty-three billion, one hundred twenty-one million, three hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •