Base | Representation |
---|---|
bin | 100110100101… |
… | …1110000101101 |
3 | 1102001221211001 |
4 | 1031023300231 |
5 | 20134431021 |
6 | 2001400301 |
7 | 333660046 |
oct | 115136055 |
9 | 42057731 |
10 | 20233261 |
11 | 1046a604 |
12 | 6939091 |
13 | 4265659 |
14 | 29898cd |
15 | 1b9a091 |
hex | 134bc2d |
20233261 has 4 divisors (see below), whose sum is σ = 21112992. Its totient is φ = 19353532.
The previous prime is 20233249. The next prime is 20233289. The reversal of 20233261 is 16233202.
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, and also an emirpimes, since its reverse is a distinct semiprime: 16233202 = 2 ⋅8116601.
It is a cyclic number.
It is not a de Polignac number, because 20233261 - 213 = 20225069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20233231) 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, 439831 + ... + 439876.
It is an arithmetic number, because the mean of its divisors is an integer number (5278248).
Almost surely, 220233261 is an apocalyptic number.
It is an amenable number.
20233261 is a deficient number, since it is larger than the sum of its proper divisors (879731).
20233261 is an equidigital number, since it uses as much as digits as its factorization.
20233261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879730.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 20233261 is about 4498.1397265981. The cubic root of 20233261 is about 272.4929650570.
Adding to 20233261 its reverse (16233202), we get a palindrome (36466463).
The spelling of 20233261 in words is "twenty million, two hundred thirty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •