Base | Representation |
---|---|
bin | 1011000000111101011010… |
… | …0110100001011100010101 |
3 | 1120212210220022020000210000 |
4 | 2300033112212201130111 |
5 | 3041412024441330401 |
6 | 41431434004121513 |
7 | 2356666450620534 |
oct | 260172646413425 |
9 | 46783808200700 |
10 | 12111113230101 |
11 | 394a326756196 |
12 | 143726b396299 |
13 | 69b0c4720312 |
14 | 2dc27698631b |
15 | 160087b14186 |
hex | b03d69a1715 |
12111113230101 has 10 divisors (see below), whose sum is σ = 18091909887062. Its totient is φ = 8074075486680.
The previous prime is 12111113230093. The next prime is 12111113230103. The reversal of 12111113230101 is 10103231111121.
12111113230101 is a `hidden beast` number, since 121 + 111 + 132 + 301 + 0 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 12061735946001 + 49377284100 = 3473001^2 + 222210^2 .
It is not a de Polignac number, because 12111113230101 - 23 = 12111113230093 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 (12111113230103) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 74759958130 + ... + 74759958291.
Almost surely, 212111113230101 is an apocalyptic number.
It is an amenable number.
12111113230101 is a deficient number, since it is larger than the sum of its proper divisors (5980796656961).
12111113230101 is an equidigital number, since it uses as much as digits as its factorization.
12111113230101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149519916433 (or 149519916424 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 12111113230101 its reverse (10103231111121), we get a palindrome (22214344341222).
The spelling of 12111113230101 in words is "twelve trillion, one hundred eleven billion, one hundred thirteen million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •