Base | Representation |
---|---|
bin | 11001101001111001111111… |
… | …10010011101011101001101 |
3 | 21101202021011210120100201102 |
4 | 30310330333302131131031 |
5 | 24343302333200003141 |
6 | 315552523534352445 |
7 | 14611611554451260 |
oct | 1464747762353515 |
9 | 241667153510642 |
10 | 56415465625421 |
11 | 16a80734663151 |
12 | 63b184135b725 |
13 | 2562c56548046 |
14 | dd0747588cd7 |
15 | 67c76812d99b |
hex | 334f3fc9d74d |
56415465625421 has 4 divisors (see below), whose sum is σ = 64474817857632. Its totient is φ = 48356113393212.
The previous prime is 56415465625417. The next prime is 56415465625427. The reversal of 56415465625421 is 12452656451465.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 56415465625421 - 22 = 56415465625417 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56415465625427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4029676116095 + ... + 4029676116108.
It is an arithmetic number, because the mean of its divisors is an integer number (16118704464408).
Almost surely, 256415465625421 is an apocalyptic number.
It is an amenable number.
56415465625421 is a deficient number, since it is larger than the sum of its proper divisors (8059352232211).
56415465625421 is an equidigital number, since it uses as much as digits as its factorization.
56415465625421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8059352232210.
The product of its digits is 34560000, while the sum is 56.
The spelling of 56415465625421 in words is "fifty-six trillion, four hundred fifteen billion, four hundred sixty-five million, six hundred twenty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •