Base | Representation |
---|---|
bin | 1001010100001111001… |
… | …00101010001011101101 |
3 | 1010121020110121020002221 |
4 | 10222013210222023231 |
5 | 20221032120122104 |
6 | 403015231115341 |
7 | 32061300034645 |
oct | 4520744521355 |
9 | 1117213536087 |
10 | 320102114029 |
11 | 113833331085 |
12 | 52055672b51 |
13 | 2425470a339 |
14 | 116c8c09525 |
15 | 84d739ac54 |
hex | 4a8792a2ed |
320102114029 has 2 divisors, whose sum is σ = 320102114030. Its totient is φ = 320102114028.
The previous prime is 320102114021. The next prime is 320102114039. The reversal of 320102114029 is 920411201023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 184805412100 + 135296701929 = 429890^2 + 367827^2 .
It is a cyclic number.
It is not a de Polignac number, because 320102114029 - 23 = 320102114021 is a prime.
It is a super-2 number, since 2×3201021140292 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 320102113994 and 320102114012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320102114021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160051057014 + 160051057015.
It is an arithmetic number, because the mean of its divisors is an integer number (160051057015).
Almost surely, 2320102114029 is an apocalyptic number.
It is an amenable number.
320102114029 is a deficient number, since it is larger than the sum of its proper divisors (1).
320102114029 is an equidigital number, since it uses as much as digits as its factorization.
320102114029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 320102114029 in words is "three hundred twenty billion, one hundred two million, one hundred fourteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •