Base | Representation |
---|---|
bin | 110111000000110110… |
… | …010111100111000001 |
3 | 12122110200201121000101 |
4 | 313000312113213001 |
5 | 1431433413142201 |
6 | 43045244122401 |
7 | 4160545110244 |
oct | 670066274701 |
9 | 178420647011 |
10 | 59070052801 |
11 | 23062560a61 |
12 | b546536401 |
13 | 5754ba9886 |
14 | 2c0517d25b |
15 | 180acacd01 |
hex | dc0d979c1 |
59070052801 has 2 divisors, whose sum is σ = 59070052802. Its totient is φ = 59070052800.
The previous prime is 59070052799. The next prime is 59070052807. The reversal of 59070052801 is 10825007095.
59070052801 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 43046290576 + 16023762225 = 207476^2 + 126585^2 .
It is a cyclic number.
It is not a de Polignac number, because 59070052801 - 21 = 59070052799 is a prime.
It is a super-2 number, since 2×590700528012 (a number of 22 digits) contains 22 as substring.
Together with 59070052799, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (59070052807) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 29535026400 + 29535026401.
It is an arithmetic number, because the mean of its divisors is an integer number (29535026401).
Almost surely, 259070052801 is an apocalyptic number.
It is an amenable number.
59070052801 is a deficient number, since it is larger than the sum of its proper divisors (1).
59070052801 is an equidigital number, since it uses as much as digits as its factorization.
59070052801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25200, while the sum is 37.
Adding to 59070052801 its reverse (10825007095), we get a palindrome (69895059896).
The spelling of 59070052801 in words is "fifty-nine billion, seventy million, fifty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •