Base | Representation |
---|---|
bin | 10001100001001001010100… |
… | …101111100111000000110000 |
3 | 101002210101102211002102102020 |
4 | 101201021110233213000300 |
5 | 40044244212022403402 |
6 | 431505435253351440 |
7 | 22141166436135513 |
oct | 2141112457470060 |
9 | 332711384072366 |
10 | 77044545122352 |
11 | 226044541a1175 |
12 | 87838ba338580 |
13 | 33cb366c295a2 |
14 | 1504d93b5cd7a |
15 | 8d918ac2e8bc |
hex | 461254be7030 |
77044545122352 has 20 divisors (see below), whose sum is σ = 199031741566200. Its totient is φ = 25681515040768.
The previous prime is 77044545122333. The next prime is 77044545122393. The reversal of 77044545122352 is 25322154544077.
It is a super-2 number, since 2×770445451223522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 77044545122295 and 77044545122304.
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 3 ways as a sum of consecutive naturals, for example, 802547344977 + ... + 802547345072.
It is an arithmetic number, because the mean of its divisors is an integer number (9951587078310).
Almost surely, 277044545122352 is an apocalyptic number.
It is an amenable number.
77044545122352 is an abundant number, since it is smaller than the sum of its proper divisors (121987196443848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
77044545122352 is a wasteful number, since it uses less digits than its factorization.
77044545122352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1605094690060 (or 1605094690054 counting only the distinct ones).
The product of its (nonzero) digits is 9408000, while the sum is 51.
The spelling of 77044545122352 in words is "seventy-seven trillion, forty-four billion, five hundred forty-five million, one hundred twenty-two thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •