Base | Representation |
---|---|
bin | 100011011110111000010000… |
… | …000110000001101101000100 |
3 | 202110112120122111222100000011 |
4 | 203132320100012001231010 |
5 | 130423240244101420124 |
6 | 1311522012313000004 |
7 | 44604333655462414 |
oct | 4336702006015504 |
9 | 673476574870004 |
10 | 156053611748164 |
11 | 457a5a685825a9 |
12 | 1560429a9b3004 |
13 | 690ca3c000000 |
14 | 2a7706c4a6644 |
15 | 13094a4d8e994 |
hex | 8dee10181b44 |
156053611748164 has 63 divisors (see below), whose sum is σ = 295955734012393. Its totient is φ = 71999409819792.
The previous prime is 156053611748137. The next prime is 156053611748189. The reversal of 156053611748164 is 461847116350651.
The square root of 156053611748164 is 12492142.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 133888272420100 + 22165339328064 = 11571010^2 + 4708008^2 .
It is a junction number, because it is equal to n+sod(n) for n = 156053611748099 and 156053611748108.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 54890470527 + ... + 54890473369.
Almost surely, 2156053611748164 is an apocalyptic number.
156053611748164 is the 12492142-nd square number.
It is an amenable number.
156053611748164 is a deficient number, since it is larger than the sum of its proper divisors (139902122264229).
156053611748164 is an frugal number, since it uses more digits than its factorization.
156053611748164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5768 (or 2858 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 58.
The spelling of 156053611748164 in words is "one hundred fifty-six trillion, fifty-three billion, six hundred eleven million, seven hundred forty-eight thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •