Base | Representation |
---|---|
bin | 1001000111000001110… |
… | …00000000000101110001 |
3 | 1002220221020022221200101 |
4 | 10203200320000011301 |
5 | 20112021132002004 |
6 | 355443415352401 |
7 | 31420455455236 |
oct | 4434070000561 |
9 | 1086836287611 |
10 | 313010422129 |
11 | 11082424aa89 |
12 | 507b6682701 |
13 | 2369440c342 |
14 | 1121502178d |
15 | 821e9bdba4 |
hex | 48e0e00171 |
313010422129 has 2 divisors, whose sum is σ = 313010422130. Its totient is φ = 313010422128.
The previous prime is 313010422091. The next prime is 313010422223. The reversal of 313010422129 is 921224010313.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 313010037729 + 384400 = 559473^2 + 620^2 .
It is a cyclic number.
It is not a de Polignac number, because 313010422129 - 27 = 313010422001 is a prime.
It is a super-2 number, since 2×3130104221292 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 313010422097 and 313010422106.
It is not a weakly prime, because it can be changed into another prime (313010425129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156505211064 + 156505211065.
It is an arithmetic number, because the mean of its divisors is an integer number (156505211065).
Almost surely, 2313010422129 is an apocalyptic number.
It is an amenable number.
313010422129 is a deficient number, since it is larger than the sum of its proper divisors (1).
313010422129 is an equidigital number, since it uses as much as digits as its factorization.
313010422129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 313010422129 in words is "three hundred thirteen billion, ten million, four hundred twenty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •