Base | Representation |
---|---|
bin | 110010011111010010… |
… | …111111010000000001 |
3 | 12011221010202012101122 |
4 | 302133102333100001 |
5 | 1342011303200221 |
6 | 40523230442025 |
7 | 3626266531034 |
oct | 623722772001 |
9 | 164833665348 |
10 | 54212162561 |
11 | 20a9a397137 |
12 | a60b663315 |
13 | 515c6166cb |
14 | 28a3d1101b |
15 | 1624577eab |
hex | c9f4bf401 |
54212162561 has 4 divisors (see below), whose sum is σ = 54212645124. Its totient is φ = 54211680000.
The previous prime is 54212162551. The next prime is 54212162573. The reversal of 54212162561 is 16526121245.
54212162561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 34924508161 + 19287654400 = 186881^2 + 138880^2 .
It is a cyclic number.
It is not a de Polignac number, because 54212162561 - 210 = 54212161537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54212162531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25721 + ... + 330281.
It is an arithmetic number, because the mean of its divisors is an integer number (13553161281).
Almost surely, 254212162561 is an apocalyptic number.
It is an amenable number.
54212162561 is a deficient number, since it is larger than the sum of its proper divisors (482563).
54212162561 is a wasteful number, since it uses less digits than its factorization.
54212162561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482562.
The product of its digits is 28800, while the sum is 35.
The spelling of 54212162561 in words is "fifty-four billion, two hundred twelve million, one hundred sixty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •