Base | Representation |
---|---|
bin | 10011100110011100… |
… | …10101011101001101 |
3 | 1000011101000110110202 |
4 | 21303032111131031 |
5 | 133022401303313 |
6 | 4500105543245 |
7 | 521525432114 |
oct | 116316253515 |
9 | 30141013422 |
10 | 10523072333 |
11 | 450aaaaaa4 |
12 | 20581a4b25 |
13 | cb9190227 |
14 | 71b802c7b |
15 | 418c82558 |
hex | 27339574d |
10523072333 has 2 divisors, whose sum is σ = 10523072334. Its totient is φ = 10523072332.
The previous prime is 10523072321. The next prime is 10523072383. The reversal of 10523072333 is 33327032501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10482073924 + 40998409 = 102382^2 + 6403^2 .
It is a cyclic number.
It is not a de Polignac number, because 10523072333 - 24 = 10523072317 is a prime.
It is a super-2 number, since 2×105230723332 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10523072296 and 10523072305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10523072383) 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, 5261536166 + 5261536167.
It is an arithmetic number, because the mean of its divisors is an integer number (5261536167).
Almost surely, 210523072333 is an apocalyptic number.
It is an amenable number.
10523072333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10523072333 is an equidigital number, since it uses as much as digits as its factorization.
10523072333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 29.
The spelling of 10523072333 in words is "ten billion, five hundred twenty-three million, seventy-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •