Base | Representation |
---|---|
bin | 1100110101101010110001… |
… | …1010110111110010000001 |
3 | 1211222111021010112112112102 |
4 | 3031122230122313302001 |
5 | 3322234341221310113 |
6 | 50004512221240145 |
7 | 2654600325644411 |
oct | 315325432676201 |
9 | 54874233475472 |
10 | 14116155260033 |
11 | 455269a700762 |
12 | 16bb97ba03055 |
13 | 7b51bc73aa48 |
14 | 36b322d18641 |
15 | 1972d859b758 |
hex | cd6ac6b7c81 |
14116155260033 has 8 divisors (see below), whose sum is σ = 14729980636800. Its totient is φ = 13502336507968.
The previous prime is 14116155260021. The next prime is 14116155260041. The reversal of 14116155260033 is 33006255161141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14116155260033 - 220 = 14116154211457 is a prime.
It is a super-2 number, since 2×141161552600332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14116155260083) 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 7 ways as a sum of consecutive naturals, for example, 2973548 + ... + 6088866.
It is an arithmetic number, because the mean of its divisors is an integer number (1841247579600).
Almost surely, 214116155260033 is an apocalyptic number.
It is an amenable number.
14116155260033 is a deficient number, since it is larger than the sum of its proper divisors (613825376767).
14116155260033 is a wasteful number, since it uses less digits than its factorization.
14116155260033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3312351.
The product of its (nonzero) digits is 64800, while the sum is 38.
The spelling of 14116155260033 in words is "fourteen trillion, one hundred sixteen billion, one hundred fifty-five million, two hundred sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •