Base | Representation |
---|---|
bin | 11000100100110… |
… | …11010011110110 |
3 | 112100220212022011 |
4 | 30102123103312 |
5 | 410234011141 |
6 | 32242354434 |
7 | 5052206644 |
oct | 1422332366 |
9 | 470825264 |
10 | 206157046 |
11 | a6408927 |
12 | 5905ba1a |
13 | 33931924 |
14 | 1d546194 |
15 | 13173881 |
hex | c49b4f6 |
206157046 has 4 divisors (see below), whose sum is σ = 309235572. Its totient is φ = 103078522.
The previous prime is 206157023. The next prime is 206157047. The reversal of 206157046 is 640751602.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 640751602 = 2 ⋅320375801.
It is a super-2 number, since 2×2061570462 = 85001455230892232, which contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 206156999 and 206157017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206157047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51539260 + ... + 51539263.
It is an arithmetic number, because the mean of its divisors is an integer number (77308893).
Almost surely, 2206157046 is an apocalyptic number.
206157046 is a deficient number, since it is larger than the sum of its proper divisors (103078526).
206157046 is a wasteful number, since it uses less digits than its factorization.
206157046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103078525.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 206157046 is about 14358.1700087442. The cubic root of 206157046 is about 590.7441018491.
The spelling of 206157046 in words is "two hundred six million, one hundred fifty-seven thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •