Base | Representation |
---|---|
bin | 10011010110111101110… |
… | …110010000101010101101 |
3 | 11201011210222121201102021 |
4 | 103112331312100222231 |
5 | 133244003440343313 |
6 | 2455051205030141 |
7 | 165053550346330 |
oct | 23267566205255 |
9 | 4634728551367 |
10 | 1330330012333 |
11 | 47320a679393 |
12 | 1959b09b5351 |
13 | 985ac967aba |
14 | 4856177a617 |
15 | 249119da78d |
hex | 135bdd90aad |
1330330012333 has 16 divisors (see below), whose sum is σ = 1533994899840. Its totient is φ = 1130106908736.
The previous prime is 1330330012301. The next prime is 1330330012343. The reversal of 1330330012333 is 3332100330331.
It is a cyclic number.
It is not a de Polignac number, because 1330330012333 - 25 = 1330330012301 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330330012298 and 1330330012307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330330012343) 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 in 15 ways as a sum of consecutive naturals, for example, 1128391 + ... + 1983412.
It is an arithmetic number, because the mean of its divisors is an integer number (95874681240).
Almost surely, 21330330012333 is an apocalyptic number.
It is an amenable number.
1330330012333 is a deficient number, since it is larger than the sum of its proper divisors (203664887507).
1330330012333 is a wasteful number, since it uses less digits than its factorization.
1330330012333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3112356.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 1330330012333 its reverse (3332100330331), we get a palindrome (4662430342664).
The spelling of 1330330012333 in words is "one trillion, three hundred thirty billion, three hundred thirty million, twelve thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •