Base | Representation |
---|---|
bin | 10101101000010001… |
… | …101101111001110101 |
3 | 2012221112122020222222 |
4 | 111220101231321311 |
5 | 340030410431123 |
6 | 14400305332125 |
7 | 1451343250502 |
oct | 255021557165 |
9 | 65845566888 |
10 | 23224311413 |
11 | 99385779a6 |
12 | 4601937045 |
13 | 22616a9104 |
14 | 11a45dc4a9 |
15 | 90dd6c6c8 |
hex | 56846de75 |
23224311413 has 8 divisors (see below), whose sum is σ = 23261007000. Its totient is φ = 23187644928.
The previous prime is 23224311343. The next prime is 23224311419. The reversal of 23224311413 is 31411342232.
It can be written as a sum of positive squares in 4 ways, for example, as 9951658564 + 13272652849 = 99758^2 + 115207^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23224311413 - 218 = 23224049269 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 (23224311419) 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 7 ways as a sum of consecutive naturals, for example, 2005163 + ... + 2016711.
It is an arithmetic number, because the mean of its divisors is an integer number (2907625875).
Almost surely, 223224311413 is an apocalyptic number.
It is an amenable number.
23224311413 is a deficient number, since it is larger than the sum of its proper divisors (36695587).
23224311413 is a wasteful number, since it uses less digits than its factorization.
23224311413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14551.
The product of its digits is 3456, while the sum is 26.
Adding to 23224311413 its reverse (31411342232), we get a palindrome (54635653645).
The spelling of 23224311413 in words is "twenty-three billion, two hundred twenty-four million, three hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •