Base | Representation |
---|---|
bin | 101000101101… |
… | …110111100001 |
3 | 202002021110202 |
4 | 220231313201 |
5 | 10213024013 |
6 | 1020434545 |
7 | 156503315 |
oct | 50556741 |
9 | 22067422 |
10 | 10673633 |
11 | 6030293 |
12 | 36a8a55 |
13 | 2299379 |
14 | 15bbb45 |
15 | e0c858 |
hex | a2dde1 |
10673633 has 6 divisors (see below), whose sum is σ = 11158434. Its totient is φ = 10209056.
The previous prime is 10673629. The next prime is 10673659. The reversal of 10673633 is 33637601.
It can be written as a sum of positive squares in only one way, i.e., 9784384 + 889249 = 3128^2 + 943^2 .
It is not a de Polignac number, because 10673633 - 22 = 10673629 is a prime.
It is a super-2 number, since 2×106736332 = 227852882837378, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10673596 and 10673605.
It is not an unprimeable number, because it can be changed into a prime (10673623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 9560 + ... + 10617.
It is an arithmetic number, because the mean of its divisors is an integer number (1859739).
Almost surely, 210673633 is an apocalyptic number.
It is an amenable number.
10673633 is a deficient number, since it is larger than the sum of its proper divisors (484801).
10673633 is an equidigital number, since it uses as much as digits as its factorization.
10673633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20223 (or 20200 counting only the distinct ones).
The product of its (nonzero) digits is 6804, while the sum is 29.
The square root of 10673633 is about 3267.0526472648. The cubic root of 10673633 is about 220.1763943432.
The spelling of 10673633 in words is "ten million, six hundred seventy-three thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •