Base | Representation |
---|---|
bin | 1001001011010011111… |
… | …0010011110000000100 |
3 | 120001221020210121200121 |
4 | 2102310332103300010 |
5 | 10040334143232424 |
6 | 200231542551324 |
7 | 14250560600632 |
oct | 2226476236004 |
9 | 501836717617 |
10 | 157655055364 |
11 | 60952194594 |
12 | 2667a438544 |
13 | 11b364b9411 |
14 | 78b8306352 |
15 | 417ab8dee4 |
hex | 24b4f93c04 |
157655055364 has 9 divisors (see below), whose sum is σ = 275897736597. Its totient is φ = 78827130624.
The previous prime is 157655055343. The next prime is 157655055401. The reversal of 157655055364 is 463550556751.
The square root of 157655055364 is 397058.
It is a perfect power (a square), and thus also a powerful number.
157655055364 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 101542920964 + 56112134400 = 318658^2 + 236880^2 .
It is a Duffinian 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 2 ways as a sum of consecutive naturals, for example, 694852 + ... + 893380.
Almost surely, 2157655055364 is an apocalyptic number.
157655055364 is the 397058-th square number.
It is an amenable number.
157655055364 is a deficient number, since it is larger than the sum of its proper divisors (118242681233).
157655055364 is an frugal number, since it uses more digits than its factorization.
157655055364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397062 (or 198531 counting only the distinct ones).
The product of its (nonzero) digits is 9450000, while the sum is 52.
The spelling of 157655055364 in words is "one hundred fifty-seven billion, six hundred fifty-five million, fifty-five thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •