Base | Representation |
---|---|
bin | 1000001000000101011… |
… | …1000001110011111110 |
3 | 111100100121102202222121 |
4 | 2002001113001303332 |
5 | 4241404432013240 |
6 | 144045142433154 |
7 | 13041435024412 |
oct | 2020127016376 |
9 | 440317382877 |
10 | 139609251070 |
11 | 54231867743 |
12 | 23082a327ba |
13 | 1021b93c403 |
14 | 6a85794d42 |
15 | 397178904a |
hex | 20815c1cfe |
139609251070 has 16 divisors (see below), whose sum is σ = 251369406288. Its totient is φ = 55827532800.
The previous prime is 139609251043. The next prime is 139609251071. The reversal of 139609251070 is 70152906931.
It is a super-2 number, since 2×1396092510702 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (139609251071) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1984656 + ... + 2053795.
It is an arithmetic number, because the mean of its divisors is an integer number (15710587893).
Almost surely, 2139609251070 is an apocalyptic number.
139609251070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
139609251070 is a deficient number, since it is larger than the sum of its proper divisors (111760155218).
139609251070 is a wasteful number, since it uses less digits than its factorization.
139609251070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4041915.
The product of its (nonzero) digits is 102060, while the sum is 43.
The spelling of 139609251070 in words is "one hundred thirty-nine billion, six hundred nine million, two hundred fifty-one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •