Base | Representation |
---|---|
bin | 1100000001000011001… |
… | …1000001010101010010 |
3 | 201201212011201210120002 |
4 | 3000100303001111102 |
5 | 11340242200143331 |
6 | 234500510450002 |
7 | 20625532043165 |
oct | 3002063012522 |
9 | 651764653502 |
10 | 206440240466 |
11 | 7a607152189 |
12 | 34014503902 |
13 | 1660c678655 |
14 | 9dc556badc |
15 | 5583a6d9cb |
hex | 3010cc1552 |
206440240466 has 8 divisors (see below), whose sum is σ = 325958274480. Its totient is φ = 97787482308.
The previous prime is 206440240463. The next prime is 206440240471. The reversal of 206440240466 is 664042044602.
206440240466 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 5432637907 = 206440240466 / (2 + 0 + 6 + 4 + 4 + 0 + 2 + 4 + 0 + 4 + 6 + 6).
It is not an unprimeable number, because it can be changed into a prime (206440240463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2716318916 + ... + 2716318991.
It is an arithmetic number, because the mean of its divisors is an integer number (40744784310).
Almost surely, 2206440240466 is an apocalyptic number.
206440240466 is a deficient number, since it is larger than the sum of its proper divisors (119518034014).
206440240466 is a wasteful number, since it uses less digits than its factorization.
206440240466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5432637928.
The product of its (nonzero) digits is 221184, while the sum is 38.
The spelling of 206440240466 in words is "two hundred six billion, four hundred forty million, two hundred forty thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •