Base | Representation |
---|---|
bin | 1101000111000100100001… |
… | …0000000000010010100101 |
3 | 1220001001221122221212020211 |
4 | 3101301020100000102211 |
5 | 3342134132313303141 |
6 | 50354114340455421 |
7 | 3015313112500411 |
oct | 321611020002245 |
9 | 56031848855224 |
10 | 14415122400421 |
11 | 4658467880276 |
12 | 17498b73aa571 |
13 | 807456595a02 |
14 | 37b9a4bd7d41 |
15 | 19ee85237d81 |
hex | d1c484004a5 |
14415122400421 has 4 divisors (see below), whose sum is σ = 14429668438144. Its totient is φ = 14400576362700.
The previous prime is 14415122400323. The next prime is 14415122400487. The reversal of 14415122400421 is 12400422151441.
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 a cyclic number.
It is not a de Polignac number, because 14415122400421 - 231 = 14412974916773 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 (14415122400491) 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, 7273017375 + ... + 7273019356.
It is an arithmetic number, because the mean of its divisors is an integer number (3607417109536).
Almost surely, 214415122400421 is an apocalyptic number.
It is an amenable number.
14415122400421 is a deficient number, since it is larger than the sum of its proper divisors (14546037723).
14415122400421 is an equidigital number, since it uses as much as digits as its factorization.
14415122400421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14546037722.
The product of its (nonzero) digits is 10240, while the sum is 31.
Adding to 14415122400421 its reverse (12400422151441), we get a palindrome (26815544551862).
The spelling of 14415122400421 in words is "fourteen trillion, four hundred fifteen billion, one hundred twenty-two million, four hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •