Base | Representation |
---|---|
bin | 100110100011… |
… | …011010100100 |
3 | 201000110120000 |
4 | 212203122210 |
5 | 10041402112 |
6 | 1000341300 |
7 | 151622052 |
oct | 46433244 |
9 | 21013500 |
10 | 10106532 |
11 | 5783207 |
12 | 3474830 |
13 | 212b1c7 |
14 | 14b11d2 |
15 | d497dc |
hex | 9a36a4 |
10106532 has 30 divisors (see below), whose sum is σ = 26421318. Its totient is φ = 3368736.
The previous prime is 10106507. The next prime is 10106539. The reversal of 10106532 is 23560101.
10106532 is a `hidden beast` number, since 1 + 0 + 10 + 653 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 8608356 + 1498176 = 2934^2 + 1224^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10106539) 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 9 ways as a sum of consecutive naturals, for example, 15273 + ... + 15920.
Almost surely, 210106532 is an apocalyptic number.
10106532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10106532 is an abundant number, since it is smaller than the sum of its proper divisors (16314786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10106532 is a wasteful number, since it uses less digits than its factorization.
10106532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31209 (or 31198 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 10106532 is about 3179.0772246046. The cubic root of 10106532 is about 216.2058223320.
Adding to 10106532 its reverse (23560101), we get a palindrome (33666633).
The spelling of 10106532 in words is "ten million, one hundred six thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •