Base | Representation |
---|---|
bin | 101000101101… |
… | …110010001001 |
3 | 202002021000000 |
4 | 220231302021 |
5 | 10213021124 |
6 | 1020433213 |
7 | 156502314 |
oct | 50556211 |
9 | 22067000 |
10 | 10673289 |
11 | 6030000 |
12 | 36a8809 |
13 | 2299173 |
14 | 15bb97b |
15 | e0c6c9 |
hex | a2dc89 |
10673289 has 35 divisors (see below), whose sum is σ = 17602765. Its totient is φ = 6468660.
The previous prime is 10673261. The next prime is 10673293. The reversal of 10673289 is 98237601.
The square root of 10673289 is 3267.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 10673289 - 29 = 10672777 is a prime.
It is a super-2 number, since 2×106732892 = 227838196155042, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10673249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 34 ways as a sum of consecutive naturals, for example, 970294 + ... + 970304.
Almost surely, 210673289 is an apocalyptic number.
10673289 is the 3267-th square number.
10673289 is the 1634-th centered octagonal number.
It is an amenable number.
10673289 is a deficient number, since it is larger than the sum of its proper divisors (6929476).
10673289 is an frugal number, since it uses more digits than its factorization.
10673289 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62 (or 14 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The cubic root of 10673289 is about 220.1740289664.
Multiplying 10673289 by its sum of digits (36), we get a square (384238404 = 196022).
It can be divided in two parts, 1067 and 3289, that added together give a square (4356 = 662).
The spelling of 10673289 in words is "ten million, six hundred seventy-three thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •