Base | Representation |
---|---|
bin | 1100110100110010101100… |
… | …1111100110000111101011 |
3 | 1211221001102010022200110110 |
4 | 3031030223033212013223 |
5 | 3322013024401010410 |
6 | 45553542442145403 |
7 | 2653525324024446 |
oct | 315145317460753 |
9 | 54831363280413 |
10 | 14101103141355 |
11 | 454727612115a |
12 | 16b8a7aab2263 |
13 | 7b3961174149 |
14 | 36a6d5c0865d |
15 | 196c06dde720 |
hex | cd32b3e61eb |
14101103141355 has 8 divisors (see below), whose sum is σ = 22561765026192. Its totient is φ = 7520588342048.
The previous prime is 14101103141309. The next prime is 14101103141383. The reversal of 14101103141355 is 55314130110141.
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 14101103141355 - 27 = 14101103141227 is a prime.
It is a super-2 number, since 2×141011031413552 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 470036771364 + ... + 470036771393.
It is an arithmetic number, because the mean of its divisors is an integer number (2820220628274).
Almost surely, 214101103141355 is an apocalyptic number.
14101103141355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14101103141355 is a deficient number, since it is larger than the sum of its proper divisors (8460661884837).
14101103141355 is an equidigital number, since it uses as much as digits as its factorization.
14101103141355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940073542765.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 14101103141355 its reverse (55314130110141), we get a palindrome (69415233251496).
The spelling of 14101103141355 in words is "fourteen trillion, one hundred one billion, one hundred three million, one hundred forty-one thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •