Base | Representation |
---|---|
bin | 111011011100101001… |
… | …010100101000100001 |
3 | 20002202111222011110112 |
4 | 323130221110220201 |
5 | 2021211312041311 |
6 | 45153531341105 |
7 | 4416541424354 |
oct | 733451245041 |
9 | 202674864415 |
10 | 63831362081 |
11 | 2508615a103 |
12 | 10454bb1795 |
13 | 6033455546 |
14 | 313766a29b |
15 | 19d8cb628b |
hex | edca54a21 |
63831362081 has 4 divisors (see below), whose sum is σ = 63899196564. Its totient is φ = 63763527600.
The previous prime is 63831362069. The next prime is 63831362117. The reversal of 63831362081 is 18026313836.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 50213639056 + 13617723025 = 224084^2 + 116695^2 .
It is a cyclic number.
It is not a de Polignac number, because 63831362081 - 210 = 63831361057 is a prime.
It is a super-2 number, since 2×638313620812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (63831362041) 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, 33915830 + ... + 33917711.
It is an arithmetic number, because the mean of its divisors is an integer number (15974799141).
Almost surely, 263831362081 is an apocalyptic number.
It is an amenable number.
63831362081 is a deficient number, since it is larger than the sum of its proper divisors (67834483).
63831362081 is an equidigital number, since it uses as much as digits as its factorization.
63831362081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67834482.
The product of its (nonzero) digits is 124416, while the sum is 41.
The spelling of 63831362081 in words is "sixty-three billion, eight hundred thirty-one million, three hundred sixty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •