Base | Representation |
---|---|
bin | 11001101011110… |
… | …10100011011101 |
3 | 120000102111122021 |
4 | 30311322203131 |
5 | 420124210221 |
6 | 33214020141 |
7 | 5224244305 |
oct | 1465724335 |
9 | 500374567 |
10 | 215460061 |
11 | 100692373 |
12 | 601a7651 |
13 | 3583b17b |
14 | 20888605 |
15 | 13db0041 |
hex | cd7a8dd |
215460061 has 4 divisors (see below), whose sum is σ = 215768124. Its totient is φ = 215152000.
The previous prime is 215460059. The next prime is 215460073. The reversal of 215460061 is 160064512.
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 85932900 + 129527161 = 9270^2 + 11381^2 .
It is a cyclic number.
It is not a de Polignac number, because 215460061 - 21 = 215460059 is a prime.
It is a super-2 number, since 2×2154600612 = 92846075772247442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (215460461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 152980 + ... + 154381.
It is an arithmetic number, because the mean of its divisors is an integer number (53942031).
Almost surely, 2215460061 is an apocalyptic number.
It is an amenable number.
215460061 is a deficient number, since it is larger than the sum of its proper divisors (308063).
215460061 is an equidigital number, since it uses as much as digits as its factorization.
215460061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 308062.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 215460061 is about 14678.5578651310. The cubic root of 215460061 is about 599.4996393295.
The spelling of 215460061 in words is "two hundred fifteen million, four hundred sixty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •