Base | Representation |
---|---|
bin | 100101100011010101111111… |
… | …0110100101110110000001111 |
3 | 1121022112121200000000010202212 |
4 | 1023012223332310232300033 |
5 | 321243322041201231111 |
6 | 3130303413340541035 |
7 | 126401220545141414 |
oct | 11306537664566017 |
9 | 1538477600003685 |
10 | 330313030102031 |
11 | 9627aa73282339 |
12 | 31068a6555177b |
13 | 11240501053bc2 |
14 | 5b7d34368810b |
15 | 282c2eebe298b |
hex | 12c6afed2ec0f |
330313030102031 has 2 divisors, whose sum is σ = 330313030102032. Its totient is φ = 330313030102030.
The previous prime is 330313030101953. The next prime is 330313030102171. The reversal of 330313030102031 is 130201030313033.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 330313030102031 - 210 = 330313030101007 is a prime.
It is a super-2 number, since 2×3303130301020312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330313030101988 and 330313030102006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330313030902031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165156515051015 + 165156515051016.
It is an arithmetic number, because the mean of its divisors is an integer number (165156515051016).
Almost surely, 2330313030102031 is an apocalyptic number.
330313030102031 is a deficient number, since it is larger than the sum of its proper divisors (1).
330313030102031 is an equidigital number, since it uses as much as digits as its factorization.
330313030102031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 330313030102031 its reverse (130201030313033), we get a palindrome (460514060415064).
The spelling of 330313030102031 in words is "three hundred thirty trillion, three hundred thirteen billion, thirty million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •