Base | Representation |
---|---|
bin | 11010111001011010… |
… | …11100110110100101 |
3 | 1101021101000021122021 |
4 | 31130231130312211 |
5 | 214033210223141 |
6 | 10344522103141 |
7 | 1020562461352 |
oct | 153455346645 |
9 | 41241007567 |
10 | 14440320421 |
11 | 614020350a |
12 | 297004aab1 |
13 | 14918c9ac7 |
14 | 9adb75629 |
15 | 597b0d6d1 |
hex | 35cb5cda5 |
14440320421 has 4 divisors (see below), whose sum is σ = 15289751052. Its totient is φ = 13590889792.
The previous prime is 14440320413. The next prime is 14440320431. The reversal of 14440320421 is 12402304441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12312343521 + 2127976900 = 110961^2 + 46130^2 .
It is a cyclic number.
It is not a de Polignac number, because 14440320421 - 23 = 14440320413 is a prime.
It is a super-2 number, since 2×144403204212 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14440320431) 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, 424715290 + ... + 424715323.
It is an arithmetic number, because the mean of its divisors is an integer number (3822437763).
Almost surely, 214440320421 is an apocalyptic number.
It is an amenable number.
14440320421 is a deficient number, since it is larger than the sum of its proper divisors (849430631).
14440320421 is an equidigital number, since it uses as much as digits as its factorization.
14440320421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 849430630.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 14440320421 its reverse (12402304441), we get a palindrome (26842624862).
The spelling of 14440320421 in words is "fourteen billion, four hundred forty million, three hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •