Base | Representation |
---|---|
bin | 101000110001… |
… | …111110010100 |
3 | 202010010112200 |
4 | 220301332110 |
5 | 10214043302 |
6 | 1021044500 |
7 | 156603333 |
oct | 50617624 |
9 | 22103480 |
10 | 10690452 |
11 | 6041993 |
12 | 36b6730 |
13 | 22a3c16 |
14 | 15c3d1a |
15 | e1281c |
hex | a31f94 |
10690452 has 36 divisors (see below), whose sum is σ = 27218100. Its totient is φ = 3537792.
The previous prime is 10690451. The next prime is 10690457. The reversal of 10690452 is 25409601.
10690452 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 4309776 + 6380676 = 2076^2 + 2526^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×106904522 = 228571527928608, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10690451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4368 + ... + 6360.
Almost surely, 210690452 is an apocalyptic number.
10690452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10690452 is an abundant number, since it is smaller than the sum of its proper divisors (16527648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10690452 is a wasteful number, since it uses less digits than its factorization.
10690452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2152 (or 2147 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 10690452 is about 3269.6256666475. The cubic root of 10690452 is about 220.2919814601.
The spelling of 10690452 in words is "ten million, six hundred ninety thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •