Base | Representation |
---|---|
bin | 11000111111111011… |
… | …11011100101010101 |
3 | 1021122100102010222012 |
4 | 30133331323211111 |
5 | 204441313333141 |
6 | 10055435314005 |
7 | 653406401444 |
oct | 143775734525 |
9 | 37570363865 |
10 | 13421230421 |
11 | 5767a31075 |
12 | 27268ab905 |
13 | 135b737781 |
14 | 914698d5b |
15 | 53840aceb |
hex | 31ff7b955 |
13421230421 has 8 divisors (see below), whose sum is σ = 13886641080. Its totient is φ = 12955993792.
The previous prime is 13421230373. The next prime is 13421230519. The reversal of 13421230421 is 12403212431.
It can be written as a sum of positive squares in 4 ways, for example, as 7921 + 13421222500 = 89^2 + 115850^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 13421230421 - 230 = 12347488597 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 (13421233421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 124451 + ... + 205743.
It is an arithmetic number, because the mean of its divisors is an integer number (1735830135).
Almost surely, 213421230421 is an apocalyptic number.
It is an amenable number.
13421230421 is a deficient number, since it is larger than the sum of its proper divisors (465410659).
13421230421 is an equidigital number, since it uses as much as digits as its factorization.
13421230421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87015.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13421230421 its reverse (12403212431), we get a palindrome (25824442852).
The spelling of 13421230421 in words is "thirteen billion, four hundred twenty-one million, two hundred thirty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •