Base | Representation |
---|---|
bin | 1000010010000001… |
… | …1110000000110011 |
3 | 12201221011101110002 |
4 | 2010200132000303 |
5 | 14023103312201 |
6 | 1004332500215 |
7 | 106043033630 |
oct | 20440360063 |
9 | 5657141402 |
10 | 2223104051 |
11 | a4097aa83 |
12 | 52061a66b |
13 | 2957608ac |
14 | 171373187 |
15 | d028276b |
hex | 8481e033 |
2223104051 has 4 divisors (see below), whose sum is σ = 2540690352. Its totient is φ = 1905517752.
The previous prime is 2223104029. The next prime is 2223104057. The reversal of 2223104051 is 1504013222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2223104051 is a prime.
It is a super-2 number, since 2×22231040512 = 9884383243145221202, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2223104057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 158793140 + ... + 158793153.
It is an arithmetic number, because the mean of its divisors is an integer number (635172588).
Almost surely, 22223104051 is an apocalyptic number.
2223104051 is a deficient number, since it is larger than the sum of its proper divisors (317586301).
2223104051 is an equidigital number, since it uses as much as digits as its factorization.
2223104051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317586300.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 2223104051 is about 47149.8043580246. The cubic root of 2223104051 is about 1305.1284697099.
Adding to 2223104051 its reverse (1504013222), we get a palindrome (3727117273).
The spelling of 2223104051 in words is "two billion, two hundred twenty-three million, one hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •