Base | Representation |
---|---|
bin | 1000001001011010011… |
… | …1001100111011100000 |
3 | 111101021110100222020120 |
4 | 2002112213030323200 |
5 | 4243122221444243 |
6 | 144144401040240 |
7 | 13053324530100 |
oct | 2022647147340 |
9 | 441243328216 |
10 | 139965812448 |
11 | 543a5063570 |
12 | 23162326080 |
13 | 10277781c87 |
14 | 6abac8d200 |
15 | 3992c1bc83 |
hex | 20969ccee0 |
139965812448 has 288 divisors, whose sum is σ = 481295582208. Its totient is φ = 35181619200.
The previous prime is 139965812431. The next prime is 139965812477. The reversal of 139965812448 is 844218569931.
It is a junction number, because it is equal to n+sod(n) for n = 139965812391 and 139965812400.
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 47 ways as a sum of consecutive naturals, for example, 1560436 + ... + 1647692.
It is an arithmetic number, because the mean of its divisors is an integer number (1671165216).
Almost surely, 2139965812448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 139965812448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (240647791104).
139965812448 is an abundant number, since it is smaller than the sum of its proper divisors (341329769760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
139965812448 is a wasteful number, since it uses less digits than its factorization.
139965812448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87326 (or 87311 counting only the distinct ones).
The product of its digits is 14929920, while the sum is 60.
The spelling of 139965812448 in words is "one hundred thirty-nine billion, nine hundred sixty-five million, eight hundred twelve thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •