Base | Representation |
---|---|
bin | 10101100000111011… |
… | …101101000010111101 |
3 | 2012121221210111000111 |
4 | 111200323231002331 |
5 | 334302340201341 |
6 | 14340144430021 |
7 | 1445316053263 |
oct | 254073550275 |
9 | 65557714014 |
10 | 23101100221 |
11 | 9884a72571 |
12 | 4588618311 |
13 | 2241cc9694 |
14 | 11920c8433 |
15 | 903130681 |
hex | 560eed0bd |
23101100221 has 4 divisors (see below), whose sum is σ = 23479806844. Its totient is φ = 22722393600.
The previous prime is 23101100219. The next prime is 23101100291. The reversal of 23101100221 is 12200110132.
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 1970116996 + 21130983225 = 44386^2 + 145365^2 .
It is a cyclic number.
It is not a de Polignac number, because 23101100221 - 21 = 23101100219 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 (23101100291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 189353220 + ... + 189353341.
It is an arithmetic number, because the mean of its divisors is an integer number (5869951711).
Almost surely, 223101100221 is an apocalyptic number.
It is an amenable number.
23101100221 is a deficient number, since it is larger than the sum of its proper divisors (378706623).
23101100221 is an equidigital number, since it uses as much as digits as its factorization.
23101100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378706622.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 23101100221 its reverse (12200110132), we get a palindrome (35301210353).
The spelling of 23101100221 in words is "twenty-three billion, one hundred one million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •