Base | Representation |
---|---|
bin | 1100110000100… |
… | …00100011000011 |
3 | 21110101022022110 |
4 | 12120100203003 |
5 | 204344210111 |
6 | 14341510403 |
7 | 2436451020 |
oct | 630204303 |
9 | 243338273 |
10 | 107022531 |
11 | 55458680 |
12 | 2ba12403 |
13 | 19232055 |
14 | 102dc547 |
15 | 95e05a6 |
hex | 66108c3 |
107022531 has 32 divisors (see below), whose sum is σ = 188379648. Its totient is φ = 52323840.
The previous prime is 107022521. The next prime is 107022541. The reversal of 107022531 is 135220701.
It is an interprime number because it is at equal distance from previous prime (107022521) and next prime (107022541).
It is not a de Polignac number, because 107022531 - 26 = 107022467 is a prime.
It is a super-2 number, since 2×1070225312 = 22907644283291922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 107022498 and 107022507.
It is not an unprimeable number, because it can be changed into a prime (107022511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9700 + ... + 17553.
It is an arithmetic number, because the mean of its divisors is an integer number (5886864).
Almost surely, 2107022531 is an apocalyptic number.
107022531 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
107022531 is a deficient number, since it is larger than the sum of its proper divisors (81357117).
107022531 is a wasteful number, since it uses less digits than its factorization.
107022531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27291.
The product of its (nonzero) digits is 420, while the sum is 21.
The square root of 107022531 is about 10345.1694524546. The cubic root of 107022531 is about 474.7792599460.
The spelling of 107022531 in words is "one hundred seven million, twenty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •