Base | Representation |
---|---|
bin | 11011100101100101011001… |
… | …011110100001111000010101 |
3 | 120220121001000120020102021112 |
4 | 123211211121132201320111 |
5 | 111400332401233220041 |
6 | 1110014125233224405 |
7 | 34361543210315060 |
oct | 3345453136417025 |
9 | 526531016212245 |
10 | 121330032320021 |
11 | 357288611a4998 |
12 | 117366a6402105 |
13 | 52914b04c4175 |
14 | 21d65950778d7 |
15 | e06114e3adeb |
hex | 6e59597a1e15 |
121330032320021 has 8 divisors (see below), whose sum is σ = 139935030723840. Its totient is φ = 103043068077168.
The previous prime is 121330032319961. The next prime is 121330032320033. The reversal of 121330032320021 is 120023230033121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121330032320021 - 26 = 121330032319957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121330032322021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79508539421 + ... + 79508540946.
It is an arithmetic number, because the mean of its divisors is an integer number (17491878840480).
Almost surely, 2121330032320021 is an apocalyptic number.
It is an amenable number.
121330032320021 is a deficient number, since it is larger than the sum of its proper divisors (18604998403819).
121330032320021 is a wasteful number, since it uses less digits than its factorization.
121330032320021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159017080483.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 121330032320021 its reverse (120023230033121), we get a palindrome (241353262353142).
The spelling of 121330032320021 in words is "one hundred twenty-one trillion, three hundred thirty billion, thirty-two million, three hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •