Base | Representation |
---|---|
bin | 111000011111101000… |
… | …0010011010100010001 |
3 | 102121011000120221020011 |
4 | 1300333100103110101 |
5 | 3441431000303241 |
6 | 131422255314521 |
7 | 11523300503422 |
oct | 1607720232421 |
9 | 377130527204 |
10 | 121320322321 |
11 | 474a71828a0 |
12 | 1b619b1ba41 |
13 | b5958b9393 |
14 | 5c2c837649 |
15 | 3250d5c281 |
hex | 1c3f413511 |
121320322321 has 32 divisors (see below), whose sum is σ = 135610675200. Its totient is φ = 107613982080.
The previous prime is 121320322309. The next prime is 121320322369. The reversal of 121320322321 is 123223023121.
It is not a de Polignac number, because 121320322321 - 221 = 121318225169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 121320322292 and 121320322301.
It is not an unprimeable number, because it can be changed into a prime (121320322301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30955000 + ... + 30958918.
It is an arithmetic number, because the mean of its divisors is an integer number (4237833600).
Almost surely, 2121320322321 is an apocalyptic number.
121320322321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121320322321 is a deficient number, since it is larger than the sum of its proper divisors (14290352879).
121320322321 is a wasteful number, since it uses less digits than its factorization.
121320322321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4429.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 121320322321 its reverse (123223023121), we get a palindrome (244543345442).
The spelling of 121320322321 in words is "one hundred twenty-one billion, three hundred twenty million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •