Base | Representation |
---|---|
bin | 11100101110010001001000… |
… | …11100001100100010011000 |
3 | 22021122021012021201020000222 |
4 | 32113020210130030202120 |
5 | 31234323044002114021 |
6 | 342200223422415212 |
7 | 16206222110145614 |
oct | 1627104434144230 |
9 | 267567167636028 |
10 | 63162400426136 |
11 | 191420294446a0 |
12 | 7101368131508 |
13 | 293225ba528ab |
14 | 118510dc74344 |
15 | 747eeb8916ab |
hex | 39722470c898 |
63162400426136 has 32 divisors (see below), whose sum is σ = 129204427352400. Its totient is φ = 28708269056640.
The previous prime is 63162400426123. The next prime is 63162400426163.
63162400426136 is nontrivially palindromic in base 10.
63162400426136 is digitally balanced in base 5, 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 (44).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22583291 + ... + 25225578.
Almost surely, 263162400426136 is an apocalyptic number.
It is an amenable number.
63162400426136 is an abundant number, since it is smaller than the sum of its proper divisors (66042026926264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
63162400426136 is a wasteful number, since it uses less digits than its factorization.
63162400426136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47823899 (or 47823895 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 44.
It can be divided in two parts, 63162400 and 426136, that added together give a palindrome (63588536).
The spelling of 63162400426136 in words is "sixty-three trillion, one hundred sixty-two billion, four hundred million, four hundred twenty-six thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •