Base | Representation |
---|---|
bin | 11000100111001… |
… | …00011101010101 |
3 | 112101111002022000 |
4 | 30103210131111 |
5 | 410323103121 |
6 | 32253025513 |
7 | 5054565315 |
oct | 1423443525 |
9 | 471432260 |
10 | 206456661 |
11 | a65a2a44 |
12 | 59185299 |
13 | 33a08108 |
14 | 1d5c3445 |
15 | 131d2526 |
hex | c4e4755 |
206456661 has 16 divisors (see below), whose sum is σ = 308275200. Its totient is φ = 136551744.
The previous prime is 206456651. The next prime is 206456669. The reversal of 206456661 is 166654602.
It is a happy number.
206456661 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 206456661 - 217 = 206325589 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206456669) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26676 + ... + 33533.
It is an arithmetic number, because the mean of its divisors is an integer number (19267200).
Almost surely, 2206456661 is an apocalyptic number.
It is an amenable number.
206456661 is a deficient number, since it is larger than the sum of its proper divisors (101818539).
206456661 is a wasteful number, since it uses less digits than its factorization.
206456661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60345 (or 60339 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 206456661 is about 14368.5998274014. The cubic root of 206456661 is about 591.0301461084.
It can be divided in two parts, 20 and 6456661, that added together give a square (6456681 = 25412).
The spelling of 206456661 in words is "two hundred six million, four hundred fifty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •