Base | Representation |
---|---|
bin | 11011100101011110010010… |
… | …101000100101000001001001 |
3 | 120220120022022202011111121101 |
4 | 123211132102220211001021 |
5 | 111400221234214233113 |
6 | 1110010424114341401 |
7 | 34361153130020443 |
oct | 3345362250450111 |
9 | 526508282144541 |
10 | 121322401321033 |
11 | 357255a574a460 |
12 | 1173511688a861 |
13 | 529086555aa53 |
14 | 21d606d7c5493 |
15 | e05d1a02e2dd |
hex | 6e5792a25049 |
121322401321033 has 16 divisors (see below), whose sum is σ = 132401164757760. Its totient is φ = 110251882960000.
The previous prime is 121322401321027. The next prime is 121322401321081. The reversal of 121322401321033 is 330123104223121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121322401321033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121322401320992 and 121322401321010.
It is not an unprimeable number, because it can be changed into a prime (121322401321003) 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, 1325462013 + ... + 1325553541.
It is an arithmetic number, because the mean of its divisors is an integer number (8275072797360).
Almost surely, 2121322401321033 is an apocalyptic number.
It is an amenable number.
121322401321033 is a deficient number, since it is larger than the sum of its proper divisors (11078763436727).
121322401321033 is a wasteful number, since it uses less digits than its factorization.
121322401321033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135248.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 121322401321033 its reverse (330123104223121), we get a palindrome (451445505544154).
The spelling of 121322401321033 in words is "one hundred twenty-one trillion, three hundred twenty-two billion, four hundred one million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •