Base | Representation |
---|---|
bin | 1001010001011111011… |
… | …1000101011110110000 |
3 | 120020012212121010201010 |
4 | 2110113313011132300 |
5 | 10102233402400123 |
6 | 201104330110520 |
7 | 14336644363041 |
oct | 2242767053660 |
9 | 506185533633 |
10 | 159314106288 |
11 | 61623729057 |
12 | 26a61b7b440 |
13 | 1203c12915c |
14 | 79d47ac8c8 |
15 | 4226654993 |
hex | 2517dc57b0 |
159314106288 has 160 divisors (see below), whose sum is σ = 439901130240. Its totient is φ = 49592954880.
The previous prime is 159314106277. The next prime is 159314106319. The reversal of 159314106288 is 882601413951.
It is a happy number.
It is a super-2 number, since 2×1593141062882 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6152248 + ... + 6178088.
It is an arithmetic number, because the mean of its divisors is an integer number (2749382064).
Almost surely, 2159314106288 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 159314106288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219950565120).
159314106288 is an abundant number, since it is smaller than the sum of its proper divisors (280587023952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
159314106288 is a wasteful number, since it uses less digits than its factorization.
159314106288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26027 (or 26021 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 48.
The spelling of 159314106288 in words is "one hundred fifty-nine billion, three hundred fourteen million, one hundred six thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •