Base | Representation |
---|---|
bin | 1100110001010110100010… |
… | …1000001101000000110001 |
3 | 1211201101212100211210220121 |
4 | 3030111220220031000301 |
5 | 3320031010341211040 |
6 | 45510450215010241 |
7 | 2646333636024043 |
oct | 314255050150061 |
9 | 54641770753817 |
10 | 14042003460145 |
11 | 45241a8973a11 |
12 | 16a9526669981 |
13 | 7ab2030c278b |
14 | 3678cab55a93 |
15 | 1953e872cc4a |
hex | cc568a0d031 |
14042003460145 has 32 divisors (see below), whose sum is σ = 16997545958400. Its totient is φ = 11135874786816.
The previous prime is 14042003460131. The next prime is 14042003460151. The reversal of 14042003460145 is 54106430024041.
It is a cyclic number.
It is not a de Polignac number, because 14042003460145 - 29 = 14042003459633 is a prime.
It is a super-2 number, since 2×140420034601452 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 14042003460145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 619151916 + ... + 619174594.
It is an arithmetic number, because the mean of its divisors is an integer number (531173311200).
Almost surely, 214042003460145 is an apocalyptic number.
It is an amenable number.
14042003460145 is a deficient number, since it is larger than the sum of its proper divisors (2955542498255).
14042003460145 is a wasteful number, since it uses less digits than its factorization.
14042003460145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24657.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 14042003460145 its reverse (54106430024041), we get a palindrome (68148433484186).
The spelling of 14042003460145 in words is "fourteen trillion, forty-two billion, three million, four hundred sixty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •