Base | Representation |
---|---|
bin | 1000000011110101011… |
… | …0100111000111110111 |
3 | 111020102002112000002120 |
4 | 2000331112213013313 |
5 | 4232040340303223 |
6 | 143340024011023 |
7 | 13001242024404 |
oct | 2007526470767 |
9 | 436362460076 |
10 | 138468291063 |
11 | 537a6816593 |
12 | 22a04900a73 |
13 | 10099449c4b |
14 | 69b80332ab |
15 | 3906511be3 |
hex | 203d5a71f7 |
138468291063 has 32 divisors (see below), whose sum is σ = 193660346880. Its totient is φ = 87836981760.
The previous prime is 138468291011. The next prime is 138468291083. The reversal of 138468291063 is 360192864831.
It is not a de Polignac number, because 138468291063 - 221 = 138466193911 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 138468290997 and 138468291015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (138468291083) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20237523 + ... + 20244363.
It is an arithmetic number, because the mean of its divisors is an integer number (6051885840).
Almost surely, 2138468291063 is an apocalyptic number.
138468291063 is a deficient number, since it is larger than the sum of its proper divisors (55192055817).
138468291063 is a wasteful number, since it uses less digits than its factorization.
138468291063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8359.
The product of its (nonzero) digits is 1492992, while the sum is 51.
The spelling of 138468291063 in words is "one hundred thirty-eight billion, four hundred sixty-eight million, two hundred ninety-one thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •