Base | Representation |
---|---|
bin | 110101100000101011… |
… | …011010110000111001 |
3 | 12111022020200010212221 |
4 | 311200223122300321 |
5 | 1420132340210101 |
6 | 42221205404041 |
7 | 4102553532100 |
oct | 654053326071 |
9 | 174266603787 |
10 | 57456569401 |
11 | 22404810000 |
12 | b176109621 |
13 | 555883287a |
14 | 2ad0b79037 |
15 | 17642e8aa1 |
hex | d60adac39 |
57456569401 has 45 divisors (see below), whose sum is σ = 73781208405. Its totient is φ = 44613150120.
The previous prime is 57456569393. The next prime is 57456569407. The reversal of 57456569401 is 10496565475.
It is a happy number.
The square root of 57456569401 is 239701.
It is a perfect power (a square), and thus also a powerful number.
57456569401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 57456569401 - 23 = 57456569393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (57456569407) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 203026606 + ... + 203026888.
It is an arithmetic number, because the mean of its divisors is an integer number (1639582409).
Almost surely, 257456569401 is an apocalyptic number.
57456569401 is the 239701-st square number.
57456569401 is the 119851-st centered octagonal number.
It is an amenable number.
57456569401 is a deficient number, since it is larger than the sum of its proper divisors (16324639004).
57456569401 is an frugal number, since it uses more digits than its factorization.
57456569401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624 (or 301 counting only the distinct ones).
The product of its (nonzero) digits is 4536000, while the sum is 52.
The spelling of 57456569401 in words is "fifty-seven billion, four hundred fifty-six million, five hundred sixty-nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •