Base | Representation |
---|---|
bin | 11000100110111… |
… | …01110100111110 |
3 | 112101102201001010 |
4 | 30103131310332 |
5 | 410321221002 |
6 | 32252300050 |
7 | 5054423166 |
oct | 1423356476 |
9 | 471381033 |
10 | 206429502 |
11 | a65845a4 |
12 | 59171626 |
13 | 339c8946 |
14 | 1d5b75a6 |
15 | 131c946c |
hex | c4ddd3e |
206429502 has 8 divisors (see below), whose sum is σ = 412859016. Its totient is φ = 68809832.
The previous prime is 206429501. The next prime is 206429513. The reversal of 206429502 is 205924602.
It is a sphenic number, since it is the product of 3 distinct primes.
206429502 is an admirable number.
It is a super-2 number, since 2×2064295022 = 85226278591936008, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 206429502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206429501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17202453 + ... + 17202464.
It is an arithmetic number, because the mean of its divisors is an integer number (51607377).
Almost surely, 2206429502 is an apocalyptic number.
206429502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
206429502 is a wasteful number, since it uses less digits than its factorization.
206429502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34404922.
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 206429502 is about 14367.6547146707. The cubic root of 206429502 is about 591.0042286567.
The spelling of 206429502 in words is "two hundred six million, four hundred twenty-nine thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •