Base | Representation |
---|---|
bin | 1100111010110011101000… |
… | …0001111001010000111111 |
3 | 1212021221010011211110012111 |
4 | 3032230322001321100333 |
5 | 3330211133142014403 |
6 | 50113231504314451 |
7 | 2664144012313024 |
oct | 316547201712077 |
9 | 55257104743174 |
10 | 14204430423103 |
11 | 4587079735288 |
12 | 1714ab7012a27 |
13 | 7c061a0c884b |
14 | 3716d8b0754b |
15 | 1997532ba56d |
hex | ceb3a07943f |
14204430423103 has 8 divisors (see below), whose sum is σ = 14375850185088. Its totient is φ = 14033017376664.
The previous prime is 14204430423041. The next prime is 14204430423133. The reversal of 14204430423103 is 30132403440241.
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 14204430423103 - 221 = 14204428325951 is a prime.
It is a super-2 number, since 2×142044304231032 (a number of 27 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 (14204430423133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2643700 + ... + 5949622.
It is an arithmetic number, because the mean of its divisors is an integer number (1796981273136).
Almost surely, 214204430423103 is an apocalyptic number.
14204430423103 is a deficient number, since it is larger than the sum of its proper divisors (171419761985).
14204430423103 is an equidigital number, since it uses as much as digits as its factorization.
14204430423103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3357773.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 14204430423103 its reverse (30132403440241), we get a palindrome (44336833863344).
The spelling of 14204430423103 in words is "fourteen trillion, two hundred four billion, four hundred thirty million, four hundred twenty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •