Base | Representation |
---|---|
bin | 101000101101… |
… | …101111111001 |
3 | 202002020210200 |
4 | 220231233321 |
5 | 10213020040 |
6 | 1020432413 |
7 | 156502020 |
oct | 50555771 |
9 | 22066720 |
10 | 10673145 |
11 | 602a98a |
12 | 36a8709 |
13 | 2299092 |
14 | 15bb8b7 |
15 | e0c630 |
hex | a2dbf9 |
10673145 has 48 divisors (see below), whose sum is σ = 21844992. Its totient is φ = 4717440.
The previous prime is 10673141. The next prime is 10673149. The reversal of 10673145 is 54137601.
It is an interprime number because it is at equal distance from previous prime (10673141) and next prime (10673149).
It is not a de Polignac number, because 10673145 - 22 = 10673141 is a prime.
It is a super-2 number, since 2×106731452 = 227832048382050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10673141) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9219 + ... + 10311.
It is an arithmetic number, because the mean of its divisors is an integer number (455104).
Almost surely, 210673145 is an apocalyptic number.
10673145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10673145 is an abundant number, since it is smaller than the sum of its proper divisors (11171847).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10673145 is a wasteful number, since it uses less digits than its factorization.
10673145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1142 (or 1139 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 10673145 is about 3266.9779613582. The cubic root of 10673145 is about 220.1730387935.
The spelling of 10673145 in words is "ten million, six hundred seventy-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •