Base | Representation |
---|---|
bin | 101110111101001010011101… |
… | …000011110000110010100111 |
3 | 1000002012110210122100212200221 |
4 | 232331022131003300302213 |
5 | 204032003120122113323 |
6 | 2011114513431345211 |
7 | 61333042625355106 |
oct | 5675123503606247 |
9 | 1002173718325627 |
10 | 206513252535463 |
11 | 5a88a8622a3245 |
12 | 1b1b379a522207 |
13 | 8b3016825abb3 |
14 | 38dd41ab3c03d |
15 | 18d1d3c34255d |
hex | bbd29d0f0ca7 |
206513252535463 has 8 divisors (see below), whose sum is σ = 218661957682560. Its totient is φ = 194364643695360.
The previous prime is 206513252535341. The next prime is 206513252535487. The reversal of 206513252535463 is 364535252315602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 206513252535463 - 233 = 206504662600871 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 206513252535463.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (206513252530463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19638583 + ... + 28261288.
It is an arithmetic number, because the mean of its divisors is an integer number (27332744710320).
Almost surely, 2206513252535463 is an apocalyptic number.
206513252535463 is a deficient number, since it is larger than the sum of its proper divisors (12148705147097).
206513252535463 is a wasteful number, since it uses less digits than its factorization.
206513252535463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48153497.
The product of its (nonzero) digits is 19440000, while the sum is 52.
The spelling of 206513252535463 in words is "two hundred six trillion, five hundred thirteen billion, two hundred fifty-two million, five hundred thirty-five thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •