Base | Representation |
---|---|
bin | 10011111100110100… |
… | …010001101001111111 |
3 | 2001021220012110121000 |
4 | 103330310101221333 |
5 | 322332341301143 |
6 | 13501343341343 |
7 | 1355562106560 |
oct | 237464215177 |
9 | 61256173530 |
10 | 21421431423 |
11 | 90a2926537 |
12 | 4199bb1853 |
13 | 203501b212 |
14 | 1072db6167 |
15 | 855945bd3 |
hex | 4fcd11a7f |
21421431423 has 16 divisors (see below), whose sum is σ = 36269090560. Its totient is φ = 12240817848.
The previous prime is 21421431413. The next prime is 21421431433. The reversal of 21421431423 is 32413412412.
21421431423 is a `hidden beast` number, since 21 + 4 + 214 + 3 + 1 + 423 = 666.
It is an interprime number because it is at equal distance from previous prime (21421431413) and next prime (21421431433).
It is not a de Polignac number, because 21421431423 - 212 = 21421427327 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21421431413) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56670265 + ... + 56670642.
It is an arithmetic number, because the mean of its divisors is an integer number (2266818160).
Almost surely, 221421431423 is an apocalyptic number.
21421431423 is a deficient number, since it is larger than the sum of its proper divisors (14847659137).
21421431423 is a wasteful number, since it uses less digits than its factorization.
21421431423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113340923 (or 113340917 counting only the distinct ones).
The product of its digits is 4608, while the sum is 27.
Adding to 21421431423 its reverse (32413412412), we get a palindrome (53834843835).
The spelling of 21421431423 in words is "twenty-one billion, four hundred twenty-one million, four hundred thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •