Base | Representation |
---|---|
bin | 10011110101100101… |
… | …00010001001110001 |
3 | 1000111012212011021202 |
4 | 21322302202021301 |
5 | 133302400031113 |
6 | 4520442300545 |
7 | 524626344416 |
oct | 117262421161 |
9 | 30435764252 |
10 | 10650002033 |
11 | 4575715180 |
12 | 20927b7755 |
13 | 1009572368 |
14 | 73060410d |
15 | 424ea6258 |
hex | 27aca2271 |
10650002033 has 4 divisors (see below), whose sum is σ = 11618184048. Its totient is φ = 9681820020.
The previous prime is 10650002029. The next prime is 10650002071. The reversal of 10650002033 is 33020005601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10650002033 - 22 = 10650002029 is a prime.
It is a super-2 number, since 2×106500020332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10650001996 and 10650002014.
It is not an unprimeable number, because it can be changed into a prime (10650002023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 484090991 + ... + 484091012.
It is an arithmetic number, because the mean of its divisors is an integer number (2904546012).
Almost surely, 210650002033 is an apocalyptic number.
It is an amenable number.
10650002033 is a deficient number, since it is larger than the sum of its proper divisors (968182015).
10650002033 is an equidigital number, since it uses as much as digits as its factorization.
10650002033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 968182014.
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 10650002033 its reverse (33020005601), we get a palindrome (43670007634).
The spelling of 10650002033 in words is "ten billion, six hundred fifty million, two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •