Base | Representation |
---|---|
bin | 1000000010110000011… |
… | …0011111111110100110 |
3 | 111012122220220010012210 |
4 | 2000230012133332212 |
5 | 4230442241323242 |
6 | 143251204224250 |
7 | 12661125613101 |
oct | 2005406377646 |
9 | 435586803183 |
10 | 138178854822 |
11 | 536683a7888 |
12 | 2294399b086 |
13 | 100514aa4b8 |
14 | 698b80d738 |
15 | 38daddcd9c |
hex | 202c19ffa6 |
138178854822 has 8 divisors (see below), whose sum is σ = 276357709656. Its totient is φ = 46059618272.
The previous prime is 138178854817. The next prime is 138178854829. The reversal of 138178854822 is 228458871831.
It is a happy number.
138178854822 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
138178854822 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138178854829) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 11514904563 + ... + 11514904574.
It is an arithmetic number, because the mean of its divisors is an integer number (34544713707).
Almost surely, 2138178854822 is an apocalyptic number.
138178854822 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138178854822 is a wasteful number, since it uses less digits than its factorization.
138178854822 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23029809142.
The product of its digits is 6881280, while the sum is 57.
The spelling of 138178854822 in words is "one hundred thirty-eight billion, one hundred seventy-eight million, eight hundred fifty-four thousand, eight hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •