Base | Representation |
---|---|
bin | 1100111010110010011110… |
… | …0111000110100111010011 |
3 | 1212021220022122100221220212 |
4 | 3032230213213012213103 |
5 | 3330210020040110003 |
6 | 50113141105154335 |
7 | 2664133240614140 |
oct | 316544747064723 |
9 | 55256278327825 |
10 | 14204121410003 |
11 | 4586a30265158 |
12 | 1714a2b62b9ab |
13 | 7c059b093465 |
14 | 3716a9a693c7 |
15 | 1997360cadd8 |
hex | ceb279c69d3 |
14204121410003 has 8 divisors (see below), whose sum is σ = 16578670582272. Its totient is φ = 11915919480456.
The previous prime is 14204121409987. The next prime is 14204121410021. The reversal of 14204121410003 is 30001412140241.
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 14204121410003 - 24 = 14204121409987 is a prime.
It is a super-2 number, since 2×142041214100032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14204121710003) 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, 21586810325 + ... + 21586810982.
It is an arithmetic number, because the mean of its divisors is an integer number (2072333822784).
Almost surely, 214204121410003 is an apocalyptic number.
14204121410003 is a deficient number, since it is larger than the sum of its proper divisors (2374549172269).
14204121410003 is an equidigital number, since it uses as much as digits as its factorization.
14204121410003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43173621361.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 14204121410003 its reverse (30001412140241), we get a palindrome (44205533550244).
The spelling of 14204121410003 in words is "fourteen trillion, two hundred four billion, one hundred twenty-one million, four hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •