Base | Representation |
---|---|
bin | 1101000110010100000000… |
… | …0100110010010100100001 |
3 | 1212222211100010122122120202 |
4 | 3101211000010302110201 |
5 | 3341431000141340001 |
6 | 50344122240514545 |
7 | 3014342321012603 |
oct | 321450004622441 |
9 | 55884303578522 |
10 | 14402100340001 |
11 | 46529951a8570 |
12 | 174728231ba55 |
13 | 80615c76bb0a |
14 | 37b0cb569173 |
15 | 19e971dc996b |
hex | d1940132521 |
14402100340001 has 8 divisors (see below), whose sum is σ = 15767294584608. Its totient is φ = 13046224828000.
The previous prime is 14402100339961. The next prime is 14402100340027. The reversal of 14402100340001 is 10004300120441.
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-14402100340001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14402100340081) 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, 2329679915 + ... + 2329686096.
It is an arithmetic number, because the mean of its divisors is an integer number (1970911823076).
Almost surely, 214402100340001 is an apocalyptic number.
14402100340001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14402100340001 is a deficient number, since it is larger than the sum of its proper divisors (1365194244607).
14402100340001 is a wasteful number, since it uses less digits than its factorization.
14402100340001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4659366303.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 14402100340001 its reverse (10004300120441), we get a palindrome (24406400460442).
The spelling of 14402100340001 in words is "fourteen trillion, four hundred two billion, one hundred million, three hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •