Base | Representation |
---|---|
bin | 1001010110010010011… |
… | …00101010011111111001 |
3 | 1010201002012100010112100 |
4 | 10223021030222133321 |
5 | 20230310444320441 |
6 | 403320401334013 |
7 | 32130466321152 |
oct | 4531114523771 |
9 | 1121065303470 |
10 | 321203120121 |
11 | 114248873274 |
12 | 52302337309 |
13 | 2439b850c30 |
14 | 1179112a929 |
15 | 854dd7ecb6 |
hex | 4ac932a7f9 |
321203120121 has 12 divisors (see below), whose sum is σ = 499649298148. Its totient is φ = 197663458464.
The previous prime is 321203120071. The next prime is 321203120123. The reversal of 321203120121 is 121021302123.
321203120121 is a `hidden beast` number, since 321 + 20 + 312 + 0 + 12 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 196071840000 + 125131280121 = 442800^2 + 353739^2 .
It is not a de Polignac number, because 321203120121 - 215 = 321203087353 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 321203120094 and 321203120103.
It is not an unprimeable number, because it can be changed into a prime (321203120123) 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, 1372662790 + ... + 1372663023.
Almost surely, 2321203120121 is an apocalyptic number.
It is an amenable number.
321203120121 is a deficient number, since it is larger than the sum of its proper divisors (178446178027).
321203120121 is a wasteful number, since it uses less digits than its factorization.
321203120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2745325832 (or 2745325829 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 321203120121 its reverse (121021302123), we get a palindrome (442224422244).
The spelling of 321203120121 in words is "three hundred twenty-one billion, two hundred three million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •