Base | Representation |
---|---|
bin | 111111100001010011… |
… | …101101011110101111 |
3 | 20112001021220010120210 |
4 | 333201103231132233 |
5 | 2104140331100223 |
6 | 51155512113503 |
7 | 4633113052506 |
oct | 774123553657 |
9 | 215037803523 |
10 | 68204550063 |
11 | 26a1a765a51 |
12 | 11275695893 |
13 | 657c48b640 |
14 | 34303a583d |
15 | 1b92ba5893 |
hex | fe14ed7af |
68204550063 has 8 divisors (see below), whose sum is σ = 97934738608. Its totient is φ = 41972030784.
The previous prime is 68204550049. The next prime is 68204550077. The reversal of 68204550063 is 36005540286.
It is an interprime number because it is at equal distance from previous prime (68204550049) and next prime (68204550077).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 68204550063 - 26 = 68204549999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 1748834617 = 68204550063 / (6 + 8 + 2 + 0 + 4 + 5 + 5 + 0 + 0 + 6 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68204550023) 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, 874417270 + ... + 874417347.
It is an arithmetic number, because the mean of its divisors is an integer number (12241842326).
Almost surely, 268204550063 is an apocalyptic number.
68204550063 is a deficient number, since it is larger than the sum of its proper divisors (29730188545).
68204550063 is a wasteful number, since it uses less digits than its factorization.
68204550063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1748834633.
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 68204550063 in words is "sixty-eight billion, two hundred four million, five hundred fifty thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •