Base | Representation |
---|---|
bin | 1100110010000101101100… |
… | …0001111100111111011101 |
3 | 1211202121112102210101200110 |
4 | 3030201123001330333131 |
5 | 3320232421004344013 |
6 | 45520342145320233 |
7 | 2650262403555024 |
oct | 314413301747735 |
9 | 54677472711613 |
10 | 14054660231133 |
11 | 4529603329325 |
12 | 16aba79336079 |
13 | 7ac46c33c192 |
14 | 36836ba978bb |
15 | 1958d99822c3 |
hex | cc85b07cfdd |
14054660231133 has 8 divisors (see below), whose sum is σ = 18739786822848. Its totient is φ = 9369653563424.
The previous prime is 14054660231119. The next prime is 14054660231153. The reversal of 14054660231133 is 33113206645041.
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 14054660231133 - 233 = 14046070296541 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14054660231091 and 14054660231100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14054660231153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29707185 + ... + 30176582.
It is an arithmetic number, because the mean of its divisors is an integer number (2342473352856).
Almost surely, 214054660231133 is an apocalyptic number.
It is an amenable number.
14054660231133 is a deficient number, since it is larger than the sum of its proper divisors (4685126591715).
14054660231133 is an equidigital number, since it uses as much as digits as its factorization.
14054660231133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59962003.
The product of its (nonzero) digits is 155520, while the sum is 39.
Adding to 14054660231133 its reverse (33113206645041), we get a palindrome (47167866876174).
The spelling of 14054660231133 in words is "fourteen trillion, fifty-four billion, six hundred sixty million, two hundred thirty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •