Base | Representation |
---|---|
bin | 11000100100100… |
… | …11111000100111 |
3 | 112100212022120200 |
4 | 30102103320213 |
5 | 410232023011 |
6 | 32242001543 |
7 | 5052022164 |
oct | 1422237047 |
9 | 470768520 |
10 | 206126631 |
11 | a6397a97 |
12 | 590462b3 |
13 | 33920b29 |
14 | 1d53906b |
15 | 13169856 |
hex | c493e27 |
206126631 has 24 divisors (see below), whose sum is σ = 305061120. Its totient is φ = 134057616.
The previous prime is 206126617. The next prime is 206126647. The reversal of 206126631 is 136621602.
206126631 is a `hidden beast` number, since 2 + 0 + 6 + 1 + 26 + 631 = 666.
206126631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 206126631 - 210 = 206125607 is a prime.
It is a super-2 number, since 2×2061266312 = 84976376014820322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 206126595 and 206126604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206126681) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 176656 + ... + 177818.
It is an arithmetic number, because the mean of its divisors is an integer number (12710880).
Almost surely, 2206126631 is an apocalyptic number.
206126631 is a deficient number, since it is larger than the sum of its proper divisors (98934489).
206126631 is a wasteful number, since it uses less digits than its factorization.
206126631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1635 (or 1632 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 206126631 is about 14357.1108165954. The cubic root of 206126631 is about 590.7150489727.
The spelling of 206126631 in words is "two hundred six million, one hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •