Base | Representation |
---|---|
bin | 1100101111100100001011… |
… | …0011001000100100010001 |
3 | 1211121110121212102200100212 |
4 | 3023321002303020210101 |
5 | 3314030122312121431 |
6 | 45444412035253505 |
7 | 2644166114055563 |
oct | 313710263104421 |
9 | 54543555380325 |
10 | 14011304020241 |
11 | 4512184933380 |
12 | 16a359944a295 |
13 | 7a834cb56218 |
14 | 36621787b333 |
15 | 1946ed4e272b |
hex | cbe42cc8911 |
14011304020241 has 16 divisors (see below), whose sum is σ = 15619668524928. Its totient is φ = 12460134086400.
The previous prime is 14011304020211. The next prime is 14011304020283. The reversal of 14011304020241 is 14202040311041.
It is not a de Polignac number, because 14011304020241 - 222 = 14011299825937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14011304020201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35460965 + ... + 35853906.
It is an arithmetic number, because the mean of its divisors is an integer number (976229282808).
Almost surely, 214011304020241 is an apocalyptic number.
14011304020241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14011304020241 is a deficient number, since it is larger than the sum of its proper divisors (1608364504687).
14011304020241 is a wasteful number, since it uses less digits than its factorization.
14011304020241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71315272.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 14011304020241 its reverse (14202040311041), we get a palindrome (28213344331282).
The spelling of 14011304020241 in words is "fourteen trillion, eleven billion, three hundred four million, twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •