Base | Representation |
---|---|
bin | 11010001001000100… |
… | …11011000101100101 |
3 | 1100020002220111212010 |
4 | 31010202123011211 |
5 | 212220400321141 |
6 | 10240353544433 |
7 | 1004536426341 |
oct | 150442330545 |
9 | 40202814763 |
10 | 14034776421 |
11 | 5a522a1286 |
12 | 2878275119 |
13 | 1428896c43 |
14 | 971d6a621 |
15 | 572202416 |
hex | 34489b165 |
14034776421 has 4 divisors (see below), whose sum is σ = 18713035232. Its totient is φ = 9356517612.
The previous prime is 14034776419. The next prime is 14034776423. The reversal of 14034776421 is 12467743041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (14034776419) and next prime (14034776423).
It is not a de Polignac number, because 14034776421 - 21 = 14034776419 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14034776421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14034776423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2339129401 + ... + 2339129406.
It is an arithmetic number, because the mean of its divisors is an integer number (4678258808).
Almost surely, 214034776421 is an apocalyptic number.
It is an amenable number.
14034776421 is a deficient number, since it is larger than the sum of its proper divisors (4678258811).
14034776421 is an equidigital number, since it uses as much as digits as its factorization.
14034776421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4678258810.
The product of its (nonzero) digits is 112896, while the sum is 39.
The spelling of 14034776421 in words is "fourteen billion, thirty-four million, seven hundred seventy-six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •