Base | Representation |
---|---|
bin | 11111011000101110100001… |
… | …110101100010100011001000 |
3 | 200002202100221012010011001010 |
4 | 133120232201311202203020 |
5 | 121043111143241434224 |
6 | 1205330031130523520 |
7 | 41034651621454455 |
oct | 3730564165424310 |
9 | 602670835104033 |
10 | 138038669093064 |
11 | 3aa8a964051413 |
12 | 1359499ab965a0 |
13 | 5c03cb5591bac |
14 | 261317036082c |
15 | 10e5a8124ce29 |
hex | 7d8ba1d628c8 |
138038669093064 has 64 divisors (see below), whose sum is σ = 345247906651200. Its totient is φ = 45992727259136.
The previous prime is 138038669093009. The next prime is 138038669093089. The reversal of 138038669093064 is 460390966830831.
It is a junction number, because it is equal to n+sod(n) for n = 138038669092986 and 138038669093004.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1287104227 + ... + 1287211469.
It is an arithmetic number, because the mean of its divisors is an integer number (5394498541425).
Almost surely, 2138038669093064 is an apocalyptic number.
It is an amenable number.
138038669093064 is an abundant number, since it is smaller than the sum of its proper divisors (207209237558136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
138038669093064 is a wasteful number, since it uses less digits than its factorization.
138038669093064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130254 (or 130250 counting only the distinct ones).
The product of its (nonzero) digits is 120932352, while the sum is 66.
The spelling of 138038669093064 in words is "one hundred thirty-eight trillion, thirty-eight billion, six hundred sixty-nine million, ninety-three thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •