Base | Representation |
---|---|
bin | 1100110100110111010010… |
… | …0000000101110001111111 |
3 | 1211221011120210000102212012 |
4 | 3031031310200011301333 |
5 | 3322023034020431421 |
6 | 45554304425201435 |
7 | 2653600636620116 |
oct | 315156440056177 |
9 | 54834523012765 |
10 | 14102332202111 |
11 | 454784697674a |
12 | 16b916263027b |
13 | 7b3ac89a1c2a |
14 | 36a7b1140c7d |
15 | 196c79c6a95b |
hex | cd374805c7f |
14102332202111 has 8 divisors (see below), whose sum is σ = 14311608200064. Its totient is φ = 13894360104960.
The previous prime is 14102332202089. The next prime is 14102332202113. The reversal of 14102332202111 is 11120223320141.
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 14102332202111 - 214 = 14102332185727 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14102332202113) 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, 325953410 + ... + 325996671.
It is an arithmetic number, because the mean of its divisors is an integer number (1788951025008).
Almost surely, 214102332202111 is an apocalyptic number.
14102332202111 is a deficient number, since it is larger than the sum of its proper divisors (209275997953).
14102332202111 is an equidigital number, since it uses as much as digits as its factorization.
14102332202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651950401.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14102332202111 its reverse (11120223320141), we get a palindrome (25222555522252).
The spelling of 14102332202111 in words is "fourteen trillion, one hundred two billion, three hundred thirty-two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •