Base | Representation |
---|---|
bin | 110011110010111110… |
… | …1001011000100110101 |
3 | 101122002222000021101122 |
4 | 1213211331023010311 |
5 | 3310300420413023 |
6 | 123033244033325 |
7 | 11015303052143 |
oct | 1474575130465 |
9 | 348088007348 |
10 | 111232201013 |
11 | 4319a74aa5a |
12 | 19683532845 |
13 | a64888712b |
14 | 5552ad6593 |
15 | 2d603942c8 |
hex | 19e5f4b135 |
111232201013 has 12 divisors (see below), whose sum is σ = 112852569060. Its totient is φ = 109634777856.
The previous prime is 111232201009. The next prime is 111232201057. The reversal of 111232201013 is 310102232111.
It can be written as a sum of positive squares in 6 ways, for example, as 14232967204 + 96999233809 = 119302^2 + 311447^2 .
It is not a de Polignac number, because 111232201013 - 22 = 111232201009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111232200982 and 111232201000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111232201063) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9015833 + ... + 9028161.
It is an arithmetic number, because the mean of its divisors is an integer number (9404380755).
Almost surely, 2111232201013 is an apocalyptic number.
It is an amenable number.
111232201013 is a deficient number, since it is larger than the sum of its proper divisors (1620368047).
111232201013 is an equidigital number, since it uses as much as digits as its factorization.
111232201013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14168 (or 14095 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 111232201013 its reverse (310102232111), we get a palindrome (421334433124).
The spelling of 111232201013 in words is "one hundred eleven billion, two hundred thirty-two million, two hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •