Base | Representation |
---|---|
bin | 100111101101001… |
… | …1011111000100111 |
3 | 10102212000101012102 |
4 | 1033122123320213 |
5 | 10212034030043 |
6 | 340112242315 |
7 | 45005422043 |
oct | 11732337047 |
9 | 3385011172 |
10 | 1332330023 |
11 | 62407a2a2 |
12 | 31224039b |
13 | 18304767b |
14 | c8d39023 |
15 | 7be796b8 |
hex | 4f69be27 |
1332330023 has 4 divisors (see below), whose sum is σ = 1349195040. Its totient is φ = 1315465008.
The previous prime is 1332329987. The next prime is 1332330047. The reversal of 1332330023 is 3200332331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1332330023 - 28 = 1332329767 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1332329977 and 1332330004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1332330053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8432390 + ... + 8432547.
It is an arithmetic number, because the mean of its divisors is an integer number (337298760).
Almost surely, 21332330023 is an apocalyptic number.
1332330023 is a deficient number, since it is larger than the sum of its proper divisors (16865017).
1332330023 is an equidigital number, since it uses as much as digits as its factorization.
1332330023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16865016.
The product of its (nonzero) digits is 972, while the sum is 20.
The square root of 1332330023 is about 36501.0961890188. The cubic root of 1332330023 is about 1100.3662755455.
Adding to 1332330023 its reverse (3200332331), we get a palindrome (4532662354).
The spelling of 1332330023 in words is "one billion, three hundred thirty-two million, three hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •