Base | Representation |
---|---|
bin | 100100011000100001101100… |
… | …0001100100011101100001111 |
3 | 1112222010120222000002222102102 |
4 | 1020301003120030203230033 |
5 | 313421333402431031002 |
6 | 3052351505211145315 |
7 | 124260264306210152 |
oct | 11061033014435417 |
9 | 1488116860088372 |
10 | 320030230330127 |
11 | 92a76070939a69 |
12 | 2ba8800474523b |
13 | 1097594b6c7255 |
14 | 590578d937c99 |
15 | 26eeac2669a02 |
hex | 12310d8323b0f |
320030230330127 has 2 divisors, whose sum is σ = 320030230330128. Its totient is φ = 320030230330126.
The previous prime is 320030230330103. The next prime is 320030230330319. The reversal of 320030230330127 is 721033032030023.
It is a weak prime.
It is an emirp because it is prime and its reverse (721033032030023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 320030230330127 - 244 = 302438044285711 is a prime.
It is a super-2 number, since 2×3200302303301272 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 320030230330127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320030230380127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160015115165063 + 160015115165064.
It is an arithmetic number, because the mean of its divisors is an integer number (160015115165064).
Almost surely, 2320030230330127 is an apocalyptic number.
320030230330127 is a deficient number, since it is larger than the sum of its proper divisors (1).
320030230330127 is an equidigital number, since it uses as much as digits as its factorization.
320030230330127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 29.
The spelling of 320030230330127 in words is "three hundred twenty trillion, thirty billion, two hundred thirty million, three hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •