Base | Representation |
---|---|
bin | 1001001110000001101… |
… | …1111000010011110000 |
3 | 120010211001212101220112 |
4 | 2103200123320103300 |
5 | 10043332330240233 |
6 | 200432151400452 |
7 | 14304623502260 |
oct | 2234033702360 |
9 | 503731771815 |
10 | 158384227568 |
11 | 61196849446 |
12 | 26842683128 |
13 | 11c215a0a68 |
14 | 79470b57a0 |
15 | 41bebc5048 |
hex | 24e06f84f0 |
158384227568 has 20 divisors (see below), whose sum is σ = 350707932720. Its totient is φ = 67878954624.
The previous prime is 158384227553. The next prime is 158384227577. The reversal of 158384227568 is 865722483851.
It is a super-3 number, since 3×1583842275683 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors.
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 3 ways as a sum of consecutive naturals, for example, 707072333 + ... + 707072556.
It is an arithmetic number, because the mean of its divisors is an integer number (17535396636).
Almost surely, 2158384227568 is an apocalyptic number.
It is an amenable number.
158384227568 is an abundant number, since it is smaller than the sum of its proper divisors (192323705152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
158384227568 is a wasteful number, since it uses less digits than its factorization.
158384227568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414144904 (or 1414144898 counting only the distinct ones).
The product of its digits is 25804800, while the sum is 59.
The spelling of 158384227568 in words is "one hundred fifty-eight billion, three hundred eighty-four million, two hundred twenty-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •