Base | Representation |
---|---|
bin | 1000000111111100101… |
… | …1010011101000100000 |
3 | 111100021001111220221220 |
4 | 2001333023103220200 |
5 | 4241321042431104 |
6 | 144041353415040 |
7 | 13040511504600 |
oct | 2017713235040 |
9 | 440231456856 |
10 | 139572623904 |
11 | 5421312015a |
12 | 2307270a480 |
13 | 10214186b2c |
14 | 6a8097cc00 |
15 | 396d4517d9 |
hex | 207f2d3a20 |
139572623904 has 144 divisors (see below), whose sum is σ = 426791671488. Its totient is φ = 39822064128.
The previous prime is 139572623893. The next prime is 139572623951. The reversal of 139572623904 is 409326275931.
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 23 ways as a sum of consecutive naturals, for example, 3399402 + ... + 3440214.
It is an arithmetic number, because the mean of its divisors is an integer number (2963831052).
Almost surely, 2139572623904 is an apocalyptic number.
139572623904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139572623904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213395835744).
139572623904 is an abundant number, since it is smaller than the sum of its proper divisors (287219047584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139572623904 is a wasteful number, since it uses less digits than its factorization.
139572623904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41567 (or 41552 counting only the distinct ones).
The product of its (nonzero) digits is 2449440, while the sum is 51.
The spelling of 139572623904 in words is "one hundred thirty-nine billion, five hundred seventy-two million, six hundred twenty-three thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •