Base | Representation |
---|---|
bin | 1100101111100110110010… |
… | …0010101001011010011001 |
3 | 1211121112102200012200101121 |
4 | 3023321230202221122121 |
5 | 3314033041102411101 |
6 | 45445005333445241 |
7 | 2644222346515333 |
oct | 313715442513231 |
9 | 54545380180347 |
10 | 14012004341401 |
11 | 4512504181aa0 |
12 | 16a3753aa0821 |
13 | 7a8431c78841 |
14 | 36628289a453 |
15 | 19473ec2a0a1 |
hex | cbe6c8a9699 |
14012004341401 has 16 divisors (see below), whose sum is σ = 15304133972160. Its totient is φ = 12722934251520.
The previous prime is 14012004341317. The next prime is 14012004341417. The reversal of 14012004341401 is 10414340021041.
It is a cyclic number.
It is not a de Polignac number, because 14012004341401 - 29 = 14012004340889 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14012004341441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36593305 + ... + 36974233.
It is an arithmetic number, because the mean of its divisors is an integer number (956508373260).
Almost surely, 214012004341401 is an apocalyptic number.
14012004341401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
14012004341401 is a deficient number, since it is larger than the sum of its proper divisors (1292129630759).
14012004341401 is a wasteful number, since it uses less digits than its factorization.
14012004341401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384936.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14012004341401 its reverse (10414340021041), we get a palindrome (24426344362442).
The spelling of 14012004341401 in words is "fourteen trillion, twelve billion, four million, three hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •