Base | Representation |
---|---|
bin | 11001011110000111101100… |
… | …10010001100110011010001 |
3 | 21100022112220102122211000221 |
4 | 30233003312102030303101 |
5 | 24320134003402143001 |
6 | 315042512045513041 |
7 | 14540424353312554 |
oct | 1457036622146321 |
9 | 240275812584027 |
10 | 56010505506001 |
11 | 16934a16192702 |
12 | 6347264b72781 |
13 | 25339ca4024c7 |
14 | db8ccc74669b |
15 | 671e6605a1a1 |
hex | 32f0f648ccd1 |
56010505506001 has 2 divisors, whose sum is σ = 56010505506002. Its totient is φ = 56010505506000.
The previous prime is 56010505505947. The next prime is 56010505506041. The reversal of 56010505506001 is 10060550501065.
56010505506001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36798054499600 + 19212451006401 = 6066140^2 + 4383201^2 .
It is a cyclic number.
It is not a de Polignac number, because 56010505506001 - 213 = 56010505497809 is a prime.
It is not a weakly prime, because it can be changed into another prime (56010505506041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28005252753000 + 28005252753001.
It is an arithmetic number, because the mean of its divisors is an integer number (28005252753001).
Almost surely, 256010505506001 is an apocalyptic number.
It is an amenable number.
56010505506001 is a deficient number, since it is larger than the sum of its proper divisors (1).
56010505506001 is an equidigital number, since it uses as much as digits as its factorization.
56010505506001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22500, while the sum is 34.
The spelling of 56010505506001 in words is "fifty-six trillion, ten billion, five hundred five million, five hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •