Base | Representation |
---|---|
bin | 110100100001110000… |
… | …110101100001100001 |
3 | 12101120200110221100100 |
4 | 310201300311201201 |
5 | 1411002130300441 |
6 | 41524341413013 |
7 | 4034445542400 |
oct | 644160654141 |
9 | 171520427310 |
10 | 56401025121 |
11 | 21a129a9a61 |
12 | ab2070a169 |
13 | 541ac4885c |
14 | 2a308cd637 |
15 | 17017e4cb6 |
hex | d21c35861 |
56401025121 has 81 divisors (see below), whose sum is σ = 97394571729. Its totient is φ = 31359947472.
The previous prime is 56401025113. The next prime is 56401025129. The reversal of 56401025121 is 12152010465.
The square root of 56401025121 is 237489.
It is a perfect power (a square), and thus also a powerful number.
56401025121 is a `hidden beast` number, since 5 + 6 + 40 + 102 + 512 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (56401025113) and next prime (56401025129).
It is not a de Polignac number, because 56401025121 - 23 = 56401025113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (56401025129) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 214452436 + ... + 214452698.
Almost surely, 256401025121 is an apocalyptic number.
56401025121 is the 237489-th square number.
56401025121 is the 118745-th centered octagonal number.
It is an amenable number.
56401025121 is a deficient number, since it is larger than the sum of its proper divisors (40993546608).
56401025121 is an equidigital number, since it uses as much as digits as its factorization.
56401025121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632 (or 316 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 56401025121 its reverse (12152010465), we get a palindrome (68553035586).
The spelling of 56401025121 in words is "fifty-six billion, four hundred one million, twenty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •