Base | Representation |
---|---|
bin | 1100110010001111000101… |
… | …1010010000001000101101 |
3 | 1211202212001021011122120012 |
4 | 3030203301122100020231 |
5 | 3320303102343332110 |
6 | 45521440353103005 |
7 | 2650412050400015 |
oct | 314436132201055 |
9 | 54685037148505 |
10 | 14057183183405 |
11 | 452a68848974a |
12 | 16b0462257a65 |
13 | 7ac781c4674b |
14 | 36852aba0c45 |
15 | 1959d61e3905 |
hex | cc8f169022d |
14057183183405 has 48 divisors (see below), whose sum is σ = 18315198645120. Its totient is φ = 10351357600896.
The previous prime is 14057183183401. The next prime is 14057183183471. The reversal of 14057183183405 is 50438138175041.
It is a happy number.
It is not a de Polignac number, because 14057183183405 - 22 = 14057183183401 is a prime.
It is a super-3 number, since 3×140571831834053 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14057183183401) 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 47 ways as a sum of consecutive naturals, for example, 9140186 + ... + 10566804.
It is an arithmetic number, because the mean of its divisors is an integer number (381566638440).
Almost surely, 214057183183405 is an apocalyptic number.
It is an amenable number.
14057183183405 is a deficient number, since it is larger than the sum of its proper divisors (4258015461715).
14057183183405 is a wasteful number, since it uses less digits than its factorization.
14057183183405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1426818 (or 1426799 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 50.
The spelling of 14057183183405 in words is "fourteen trillion, fifty-seven billion, one hundred eighty-three million, one hundred eighty-three thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •