Base | Representation |
---|---|
bin | 1001000001101111… |
… | …0100011000100001 |
3 | 20020212200220100001 |
4 | 2100123310120201 |
5 | 14430320232203 |
6 | 1040241500001 |
7 | 114022646500 |
oct | 22033643041 |
9 | 6225626301 |
10 | 2423211553 |
11 | 1033926784 |
12 | 577641601 |
13 | 2c8054ab9 |
14 | 18db82837 |
15 | e2b0d91d |
hex | 906f4621 |
2423211553 has 6 divisors (see below), whose sum is σ = 2818837986. Its totient is φ = 2077038432.
The previous prime is 2423211541. The next prime is 2423211589. The reversal of 2423211553 is 3551123242.
It can be written as a sum of positive squares in only one way, i.e., 1832867344 + 590344209 = 42812^2 + 24297^2 .
It is not a de Polignac number, because 2423211553 - 25 = 2423211521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2423211053) 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 5 ways as a sum of consecutive naturals, for example, 24726600 + ... + 24726697.
It is an arithmetic number, because the mean of its divisors is an integer number (469806331).
Almost surely, 22423211553 is an apocalyptic number.
It is an amenable number.
2423211553 is a deficient number, since it is larger than the sum of its proper divisors (395626433).
2423211553 is an equidigital number, since it uses as much as digits as its factorization.
2423211553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49453311 (or 49453304 counting only the distinct ones).
The product of its digits is 7200, while the sum is 28.
The square root of 2423211553 is about 49226.1267316453. The cubic root of 2423211553 is about 1343.1683313165.
Adding to 2423211553 its reverse (3551123242), we get a palindrome (5974334795).
The spelling of 2423211553 in words is "two billion, four hundred twenty-three million, two hundred eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •