Base | Representation |
---|---|
bin | 11001100000110111111111… |
… | …00110101110000011111111 |
3 | 21100122121012110011020011210 |
4 | 30300123333212232003333 |
5 | 24323211322144114300 |
6 | 315154203422415503 |
7 | 14550314643150546 |
oct | 1460337746560377 |
9 | 240577173136153 |
10 | 56105151160575 |
11 | 16971074198840 |
12 | 6361679731593 |
13 | 253c9018382ca |
14 | dbd70a62715d |
15 | 674655197050 |
hex | 3306ff9ae0ff |
56105151160575 has 48 divisors (see below), whose sum is σ = 104457590572032. Its totient is φ = 26324997600000.
The previous prime is 56105151160571. The next prime is 56105151160649. The reversal of 56105151160575 is 57506115150165.
It is not a de Polignac number, because 56105151160575 - 22 = 56105151160571 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56105151160571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1096849326 + ... + 1096900475.
It is an arithmetic number, because the mean of its divisors is an integer number (2176199803584).
Almost surely, 256105151160575 is an apocalyptic number.
56105151160575 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
56105151160575 is a deficient number, since it is larger than the sum of its proper divisors (48352439411457).
56105151160575 is a wasteful number, since it uses less digits than its factorization.
56105151160575 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2193749856 (or 2193749851 counting only the distinct ones).
The product of its (nonzero) digits is 787500, while the sum is 48.
The spelling of 56105151160575 in words is "fifty-six trillion, one hundred five billion, one hundred fifty-one million, one hundred sixty thousand, five hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •