Base | Representation |
---|---|
bin | 10110100010100011… |
… | …110011011111011101 |
3 | 2022110200120122212211 |
4 | 112202203303133131 |
5 | 344031221201141 |
6 | 15041315400421 |
7 | 1514515502626 |
oct | 264243633735 |
9 | 68420518784 |
10 | 24202131421 |
11 | a29a521606 |
12 | 48352b3111 |
13 | 238914b830 |
14 | 1258414a4d |
15 | 969b1bd81 |
hex | 5a28f37dd |
24202131421 has 8 divisors (see below), whose sum is σ = 26065585784. Its totient is φ = 22338927360.
The previous prime is 24202131419. The next prime is 24202131439. The reversal of 24202131421 is 12413120242.
It can be written as a sum of positive squares in 4 ways, for example, as 1337364900 + 22864766521 = 36570^2 + 151211^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 24202131421 - 21 = 24202131419 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 24202131392 and 24202131401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24202161421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170401 + ... + 278281.
It is an arithmetic number, because the mean of its divisors is an integer number (3258198223).
Almost surely, 224202131421 is an apocalyptic number.
It is an amenable number.
24202131421 is a deficient number, since it is larger than the sum of its proper divisors (1863454363).
24202131421 is a wasteful number, since it uses less digits than its factorization.
24202131421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125151.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 24202131421 its reverse (12413120242), we get a palindrome (36615251663).
The spelling of 24202131421 in words is "twenty-four billion, two hundred two million, one hundred thirty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •