Base | Representation |
---|---|
bin | 1011000101100011010010… |
… | …1000011011100110101111 |
3 | 1121011100112001222022200000 |
4 | 2301120310220123212233 |
5 | 3044210110022400421 |
6 | 41532001521435343 |
7 | 2365461366036666 |
oct | 261306450334657 |
9 | 47140461868600 |
10 | 12190000200111 |
11 | 397a828358378 |
12 | 144a60649bb53 |
13 | 6a56870916b6 |
14 | 301ddb98dddd |
15 | 162153526226 |
hex | b1634a1b9af |
12190000200111 has 12 divisors (see below), whose sum is σ = 18259917995592. Its totient is φ = 8126666799912.
The previous prime is 12190000200107. The next prime is 12190000200137. The reversal of 12190000200111 is 11100200009121.
It is a happy number.
It is not a de Polignac number, because 12190000200111 - 22 = 12190000200107 is a prime.
It is a super-2 number, since 2×121900002001112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12190000200101) 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 11 ways as a sum of consecutive naturals, for example, 25082304696 + ... + 25082305181.
It is an arithmetic number, because the mean of its divisors is an integer number (1521659832966).
Almost surely, 212190000200111 is an apocalyptic number.
12190000200111 is a deficient number, since it is larger than the sum of its proper divisors (6069917795481).
12190000200111 is an frugal number, since it uses more digits than its factorization.
12190000200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50164609892 (or 50164609880 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 12190000200111 its reverse (11100200009121), we get a palindrome (23290200209232).
The spelling of 12190000200111 in words is "twelve trillion, one hundred ninety billion, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •