Base | Representation |
---|---|
bin | 1001000001101001001… |
… | …10011000001111101001 |
3 | 1002122110210201110100022 |
4 | 10200310212120033221 |
5 | 20040111222340241 |
6 | 354244530250225 |
7 | 31256031352253 |
oct | 4406446301751 |
9 | 1078423643308 |
10 | 310120121321 |
11 | 10a5807a622a |
12 | 5012a726975 |
13 | 2332368628a |
14 | 1101d212cd3 |
15 | 8100d9854b |
hex | 48349983e9 |
310120121321 has 2 divisors, whose sum is σ = 310120121322. Its totient is φ = 310120121320.
The previous prime is 310120121299. The next prime is 310120121347. The reversal of 310120121321 is 123121021013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 193961848921 + 116158272400 = 440411^2 + 340820^2 .
It is a cyclic number.
It is not a de Polignac number, because 310120121321 - 26 = 310120121257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 310120121321.
It is not a weakly prime, because it can be changed into another prime (310120121221) 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 as a sum of consecutive naturals, namely, 155060060660 + 155060060661.
It is an arithmetic number, because the mean of its divisors is an integer number (155060060661).
Almost surely, 2310120121321 is an apocalyptic number.
It is an amenable number.
310120121321 is a deficient number, since it is larger than the sum of its proper divisors (1).
310120121321 is an equidigital number, since it uses as much as digits as its factorization.
310120121321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 310120121321 its reverse (123121021013), we get a palindrome (433241142334).
The spelling of 310120121321 in words is "three hundred ten billion, one hundred twenty million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •