Base | Representation |
---|---|
bin | 1101011101011… |
… | …0000001011001 |
3 | 10221020000102202 |
4 | 3113112001121 |
5 | 103422414121 |
6 | 5333535545 |
7 | 1253553434 |
oct | 327260131 |
9 | 127200382 |
10 | 56451161 |
11 | 29957658 |
12 | 16aa45b5 |
13 | b906870 |
14 | 76d681b |
15 | 4e5140b |
hex | 35d6059 |
56451161 has 4 divisors (see below), whose sum is σ = 60793572. Its totient is φ = 52108752.
The previous prime is 56451133. The next prime is 56451173. The reversal of 56451161 is 16115465.
56451161 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.
It can be written as a sum of positive squares in 2 ways, for example, as 15555136 + 40896025 = 3944^2 + 6395^2 .
It is a cyclic number.
It is not a de Polignac number, because 56451161 - 222 = 52256857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (56451121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2171186 + ... + 2171211.
It is an arithmetic number, because the mean of its divisors is an integer number (15198393).
Almost surely, 256451161 is an apocalyptic number.
It is an amenable number.
56451161 is a deficient number, since it is larger than the sum of its proper divisors (4342411).
56451161 is a wasteful number, since it uses less digits than its factorization.
56451161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4342410.
The product of its digits is 3600, while the sum is 29.
The square root of 56451161 is about 7513.3987648733. The cubic root of 56451161 is about 383.6109182034.
The spelling of 56451161 in words is "fifty-six million, four hundred fifty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •