Base | Representation |
---|---|
bin | 10011110101101100… |
… | …10111100000111001 |
3 | 1000111021202012212222 |
4 | 21322312113200321 |
5 | 133303124211113 |
6 | 4520520013425 |
7 | 524641031432 |
oct | 117266274071 |
9 | 30437665788 |
10 | 10651007033 |
11 | 4576241257 |
12 | 2093001275 |
13 | 1009834934 |
14 | 7307c6489 |
15 | 425103e08 |
hex | 27ad97839 |
10651007033 has 2 divisors, whose sum is σ = 10651007034. Its totient is φ = 10651007032.
The previous prime is 10651007011. The next prime is 10651007051. The reversal of 10651007033 is 33070015601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8685680809 + 1965326224 = 93197^2 + 44332^2 .
It is a cyclic number.
It is not a de Polignac number, because 10651007033 - 26 = 10651006969 is a prime.
It is a super-2 number, since 2×106510070332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10651006993 and 10651007011.
It is not a weakly prime, because it can be changed into another prime (10651007333) 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, 5325503516 + 5325503517.
It is an arithmetic number, because the mean of its divisors is an integer number (5325503517).
Almost surely, 210651007033 is an apocalyptic number.
It is an amenable number.
10651007033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10651007033 is an equidigital number, since it uses as much as digits as its factorization.
10651007033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 26.
The spelling of 10651007033 in words is "ten billion, six hundred fifty-one million, seven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •