Base | Representation |
---|---|
bin | 11111101111000… |
… | …01111100111111 |
3 | 200112221010122101 |
4 | 33313201330333 |
5 | 1021122341411 |
6 | 42225525531 |
7 | 6411535462 |
oct | 1767417477 |
9 | 615833571 |
10 | 266215231 |
11 | 1272a9497 |
12 | 751a38a7 |
13 | 431cc209 |
14 | 274db2d9 |
15 | 185888c1 |
hex | fde1f3f |
266215231 has 8 divisors (see below), whose sum is σ = 269014464. Its totient is φ = 263424000.
The previous prime is 266215219. The next prime is 266215247. The reversal of 266215231 is 132512662.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 266215231 - 25 = 266215199 is a prime.
It is a super-2 number, since 2×2662152312 = 141741098432766722, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 266215231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266215211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83295 + ... + 86431.
It is an arithmetic number, because the mean of its divisors is an integer number (33626808).
Almost surely, 2266215231 is an apocalyptic number.
266215231 is a deficient number, since it is larger than the sum of its proper divisors (2799233).
266215231 is a wasteful number, since it uses less digits than its factorization.
266215231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4001.
The product of its digits is 4320, while the sum is 28.
The square root of 266215231 is about 16316.1034257570. The cubic root of 266215231 is about 643.2961709646.
Adding to 266215231 its reverse (132512662), we get a palindrome (398727893).
The spelling of 266215231 in words is "two hundred sixty-six million, two hundred fifteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •