Base | Representation |
---|---|
bin | 1111001110011… |
… | …0000011001010 |
3 | 11110011021010020 |
4 | 3303212003022 |
5 | 112321404332 |
6 | 10200401310 |
7 | 1403526360 |
oct | 363460312 |
9 | 143137106 |
10 | 63856842 |
11 | 33055655 |
12 | 19476236 |
13 | 102ca61a |
14 | 86a3630 |
15 | 591582c |
hex | 3ce60ca |
63856842 has 16 divisors (see below), whose sum is σ = 145958592. Its totient is φ = 18244800.
The previous prime is 63856801. The next prime is 63856847. The reversal of 63856842 is 24865836.
63856842 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42), and also a Moran number because the ratio is a prime number: 1520401 = 63856842 / (6 + 3 + 8 + 5 + 6 + 8 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 63856794 and 63856803.
It is not an unprimeable number, because it can be changed into a prime (63856847) 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 7 ways as a sum of consecutive naturals, for example, 760159 + ... + 760242.
It is an arithmetic number, because the mean of its divisors is an integer number (9122412).
Almost surely, 263856842 is an apocalyptic number.
63856842 is an abundant number, since it is smaller than the sum of its proper divisors (82101750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63856842 is a wasteful number, since it uses less digits than its factorization.
63856842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1520413.
The product of its digits is 276480, while the sum is 42.
The square root of 63856842 is about 7991.0476159262. The cubic root of 63856842 is about 399.7015315135.
The spelling of 63856842 in words is "sixty-three million, eight hundred fifty-six thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •