Base | Representation |
---|---|
bin | 100101100001111100100100… |
… | …1101110000111110110111011 |
3 | 1121021212021001000012102200011 |
4 | 1023003321021232013312323 |
5 | 321232200313330221411 |
6 | 3130035255542522351 |
7 | 126351312310630402 |
oct | 11303711156076673 |
9 | 1537767030172604 |
10 | 330121013132731 |
11 | 96206598749277 |
12 | 310377b74363b7 |
13 | 1122837c8b6042 |
14 | 5b73d298d4639 |
15 | 2827312515c21 |
hex | 12c3e49b87dbb |
330121013132731 has 2 divisors, whose sum is σ = 330121013132732. Its totient is φ = 330121013132730.
The previous prime is 330121013132689. The next prime is 330121013132741. The reversal of 330121013132731 is 137231310121033.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 330121013132731 - 215 = 330121013099963 is a prime.
It is a super-2 number, since 2×3301210131327312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330121013132693 and 330121013132702.
It is not a weakly prime, because it can be changed into another prime (330121013132741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165060506566365 + 165060506566366.
It is an arithmetic number, because the mean of its divisors is an integer number (165060506566366).
Almost surely, 2330121013132731 is an apocalyptic number.
330121013132731 is a deficient number, since it is larger than the sum of its proper divisors (1).
330121013132731 is an equidigital number, since it uses as much as digits as its factorization.
330121013132731 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804, while the sum is 31.
Adding to 330121013132731 its reverse (137231310121033), we get a palindrome (467352323253764).
The spelling of 330121013132731 in words is "three hundred thirty trillion, one hundred twenty-one billion, thirteen million, one hundred thirty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •