Base | Representation |
---|---|
bin | 10110011101111010… |
… | …001001101000101101 |
3 | 2022021020202102022012 |
4 | 112131322021220231 |
5 | 343401232300323 |
6 | 15025451131005 |
7 | 1512550331300 |
oct | 263572115055 |
9 | 68236672265 |
10 | 24124103213 |
11 | a25a477891 |
12 | 4813143a65 |
13 | 2375c2bab2 |
14 | 124bd02b37 |
15 | 962d57678 |
hex | 59de89a2d |
24124103213 has 6 divisors (see below), whose sum is σ = 28062732366. Its totient is φ = 20677802712.
The previous prime is 24124103209. The next prime is 24124103221. The reversal of 24124103213 is 31230142142.
It can be written as a sum of positive squares in only one way, i.e., 13601857129 + 10522246084 = 116627^2 + 102578^2 .
It is not a de Polignac number, because 24124103213 - 22 = 24124103209 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24124103203) 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 5 ways as a sum of consecutive naturals, for example, 246164270 + ... + 246164367.
It is an arithmetic number, because the mean of its divisors is an integer number (4677122061).
Almost surely, 224124103213 is an apocalyptic number.
It is an amenable number.
24124103213 is a deficient number, since it is larger than the sum of its proper divisors (3938629153).
24124103213 is an equidigital number, since it uses as much as digits as its factorization.
24124103213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492328651 (or 492328644 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 24124103213 its reverse (31230142142), we get a palindrome (55354245355).
The spelling of 24124103213 in words is "twenty-four billion, one hundred twenty-four million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •