Base | Representation |
---|---|
bin | 10011110010111… |
… | …111001010011111 |
3 | 212010222002212002 |
4 | 103302333022133 |
5 | 1140011224043 |
6 | 52542432515 |
7 | 11142040565 |
oct | 2362771237 |
9 | 763862762 |
10 | 332133023 |
11 | 160531502 |
12 | 9329273b |
13 | 53a6b921 |
14 | 32179a35 |
15 | 1e259bb8 |
hex | 13cbf29f |
332133023 has 2 divisors, whose sum is σ = 332133024. Its totient is φ = 332133022.
The previous prime is 332133019. The next prime is 332133059. The reversal of 332133023 is 320331233.
It is a weak prime.
It is an emirp because it is prime and its reverse (320331233) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 332133023 - 22 = 332133019 is a prime.
It is a super-2 number, since 2×3321330232 = 220624689934237058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 332132986 and 332133004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (332133223) 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 as a sum of consecutive naturals, namely, 166066511 + 166066512.
It is an arithmetic number, because the mean of its divisors is an integer number (166066512).
Almost surely, 2332133023 is an apocalyptic number.
332133023 is a deficient number, since it is larger than the sum of its proper divisors (1).
332133023 is an equidigital number, since it uses as much as digits as its factorization.
332133023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 20.
The square root of 332133023 is about 18224.5170855087. The cubic root of 332133023 is about 692.5280246883.
Adding to 332133023 its reverse (320331233), we get a palindrome (652464256).
The spelling of 332133023 in words is "three hundred thirty-two million, one hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •