Base | Representation |
---|---|
bin | 1010011101010111… |
… | …01111010010000001 |
3 | 112111022201101210002 |
4 | 11032223233102001 |
5 | 42444423243001 |
6 | 2325102045345 |
7 | 256101121442 |
oct | 51653572201 |
9 | 15438641702 |
10 | 5615056001 |
11 | 2421609755 |
12 | 1108579855 |
13 | 6b63c9459 |
14 | 3b3a472c9 |
15 | 22ce4a46b |
hex | 14eaef481 |
5615056001 has 2 divisors, whose sum is σ = 5615056002. Its totient is φ = 5615056000.
The previous prime is 5615055977. The next prime is 5615056129. The reversal of 5615056001 is 1006505165.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5365416001 + 249640000 = 73249^2 + 15800^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5615056001 is a prime.
It is a super-2 number, since 2×56150560012 = 63057707788732224002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5615256001) by changing a digit.
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 as a sum of consecutive naturals, namely, 2807528000 + 2807528001.
It is an arithmetic number, because the mean of its divisors is an integer number (2807528001).
Almost surely, 25615056001 is an apocalyptic number.
It is an amenable number.
5615056001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5615056001 is an equidigital number, since it uses as much as digits as its factorization.
5615056001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 29.
The square root of 5615056001 is about 74933.6773487062. The cubic root of 5615056001 is about 1777.3980416842.
The spelling of 5615056001 in words is "five billion, six hundred fifteen million, fifty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •