Base | Representation |
---|---|
bin | 1100110001010111000001… |
… | …0010111100000011101001 |
3 | 1211201102012022220120021122 |
4 | 3030111300102330003221 |
5 | 3320031241304302101 |
6 | 45510511052145025 |
7 | 2646340060334213 |
oct | 314256022740351 |
9 | 54642168816248 |
10 | 14042132103401 |
11 | 4524264549556 |
12 | 16a9561768175 |
13 | 7ab22395484c |
14 | 3678ddc815b3 |
15 | 195404b8e51b |
hex | cc5704bc0e9 |
14042132103401 has 8 divisors (see below), whose sum is σ = 14604245667264. Its totient is φ = 13490725464720.
The previous prime is 14042132103367. The next prime is 14042132103407. The reversal of 14042132103401 is 10430123124041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14042132103401 is a prime.
It is a super-3 number, since 3×140421321034013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14042132103407) 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, 2676728621 + ... + 2676733866.
It is an arithmetic number, because the mean of its divisors is an integer number (1825530708408).
Almost surely, 214042132103401 is an apocalyptic number.
It is an amenable number.
14042132103401 is a deficient number, since it is larger than the sum of its proper divisors (562113563863).
14042132103401 is an equidigital number, since it uses as much as digits as its factorization.
14042132103401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5353462591.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 14042132103401 its reverse (10430123124041), we get a palindrome (24472255227442).
The spelling of 14042132103401 in words is "fourteen trillion, forty-two billion, one hundred thirty-two million, one hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •