Base | Representation |
---|---|
bin | 1000000111010010110… |
… | …0101011010010001110 |
3 | 111022210210201021022010 |
4 | 2001310230223102032 |
5 | 4240441041302113 |
6 | 144012113402050 |
7 | 13033245303216 |
oct | 2016454532216 |
9 | 438723637263 |
10 | 139396822158 |
11 | 54132965760 |
12 | 23023869326 |
13 | 101b6922b29 |
14 | 6a65499246 |
15 | 395ccc71c3 |
hex | 2074b2b48e |
139396822158 has 32 divisors (see below), whose sum is σ = 306179740800. Its totient is φ = 41957958560.
The previous prime is 139396822127. The next prime is 139396822163. The reversal of 139396822158 is 851228693931.
It is a happy number.
139396822158 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 139396822098 and 139396822107.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 7077660 + ... + 7097327.
It is an arithmetic number, because the mean of its divisors is an integer number (9568116900).
Almost surely, 2139396822158 is an apocalyptic number.
139396822158 is an abundant number, since it is smaller than the sum of its proper divisors (166782918642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139396822158 is a wasteful number, since it uses less digits than its factorization.
139396822158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14175152.
The product of its digits is 5598720, while the sum is 57.
It can be divided in two parts, 13939682 and 2158, that added together give a triangular number (13941840 = T5280).
The spelling of 139396822158 in words is "one hundred thirty-nine billion, three hundred ninety-six million, eight hundred twenty-two thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •