Base | Representation |
---|---|
bin | 1001101111100001010110… |
… | …00110101011001000111111 |
3 | 2210212010010210101212201000 |
4 | 10313300223012223020333 |
5 | 10302002343112323203 |
6 | 113322020421421343 |
7 | 4340556121455534 |
oct | 467605306531077 |
9 | 83763123355630 |
10 | 21424020042303 |
11 | 690a96a87765a |
12 | 24a0150b6a853 |
13 | bc53793b3698 |
14 | 540cdc9dcd8b |
15 | 27244bb454a3 |
hex | 137c2b1ab23f |
21424020042303 has 64 divisors (see below), whose sum is σ = 32557702464000. Its totient is φ = 13918165417728.
The previous prime is 21424020042301. The next prime is 21424020042319. The reversal of 21424020042303 is 30324002042412.
21424020042303 is a `hidden beast` number, since 2 + 1 + 424 + 0 + 2 + 0 + 0 + 4 + 230 + 3 = 666.
It is not a de Polignac number, because 21424020042303 - 21 = 21424020042301 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21424020042301) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 368277403 + ... + 368335571.
It is an arithmetic number, because the mean of its divisors is an integer number (508714101000).
Almost surely, 221424020042303 is an apocalyptic number.
21424020042303 is a deficient number, since it is larger than the sum of its proper divisors (11133682421697).
21424020042303 is a wasteful number, since it uses less digits than its factorization.
21424020042303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59973 (or 59967 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
Adding to 21424020042303 its reverse (30324002042412), we get a palindrome (51748022084715).
The spelling of 21424020042303 in words is "twenty-one trillion, four hundred twenty-four billion, twenty million, forty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •