Base | Representation |
---|---|
bin | 10011010110111110000… |
… | …001110001111001010111 |
3 | 11201011211012022010122122 |
4 | 103112332001301321113 |
5 | 133244010224011043 |
6 | 2455051353450155 |
7 | 165053615124152 |
oct | 23267601617127 |
9 | 4634735263578 |
10 | 1330333032023 |
11 | 4732113510a6 |
12 | 1959b1a1095b |
13 | 985b04843b8 |
14 | 48561d24c99 |
15 | 24911dd5368 |
hex | 135be071e57 |
1330333032023 has 2 divisors, whose sum is σ = 1330333032024. Its totient is φ = 1330333032022.
The previous prime is 1330333032001. The next prime is 1330333032031. The reversal of 1330333032023 is 3202303330331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1330333032023 - 214 = 1330333015639 is a prime.
It is a super-3 number, since 3×13303330320233 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1330333031983 and 1330333032001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330333035023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665166516011 + 665166516012.
It is an arithmetic number, because the mean of its divisors is an integer number (665166516012).
Almost surely, 21330333032023 is an apocalyptic number.
1330333032023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330333032023 is an equidigital number, since it uses as much as digits as its factorization.
1330333032023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 26.
Adding to 1330333032023 its reverse (3202303330331), we get a palindrome (4532636362354).
The spelling of 1330333032023 in words is "one trillion, three hundred thirty billion, three hundred thirty-three million, thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •