Base | Representation |
---|---|
bin | 111100010010111… |
… | …1110011111100111 |
3 | 12020000001021202101 |
4 | 1320211332133213 |
5 | 13120421034343 |
6 | 532432352531 |
7 | 101065045102 |
oct | 17045763747 |
9 | 5200037671 |
10 | 2023221223 |
11 | 949068061 |
12 | 4856a5747 |
13 | 263217a2a |
14 | 1529c1739 |
15 | bc94ce4d |
hex | 7897e7e7 |
2023221223 has 4 divisors (see below), whose sum is σ = 2023311208. Its totient is φ = 2023131240.
The previous prime is 2023221217. The next prime is 2023221241. The reversal of 2023221223 is 3221223202.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2023221223 - 25 = 2023221191 is a prime.
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 2023221223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2023221203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20953 + ... + 66973.
It is an arithmetic number, because the mean of its divisors is an integer number (505827802).
Almost surely, 22023221223 is an apocalyptic number.
2023221223 is a deficient number, since it is larger than the sum of its proper divisors (89985).
2023221223 is an equidigital number, since it uses as much as digits as its factorization.
2023221223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89984.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2023221223 is about 44980.2314689464. The cubic root of 2023221223 is about 1264.7784502671.
Adding to 2023221223 its reverse (3221223202), we get a palindrome (5244444425).
The spelling of 2023221223 in words is "two billion, twenty-three million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •