Base | Representation |
---|---|
bin | 110100101110100001… |
… | …0100110000100101101 |
3 | 101211021012102121200121 |
4 | 1221131002212010231 |
5 | 3323343402023041 |
6 | 124003414124541 |
7 | 11115643030516 |
oct | 1513502460455 |
9 | 354235377617 |
10 | 113230111021 |
11 | 4402549a355 |
12 | 19b40650751 |
13 | a8a677c0c1 |
14 | 56a21a9a0d |
15 | 2e2a9927d1 |
hex | 1a5d0a612d |
113230111021 has 2 divisors, whose sum is σ = 113230111022. Its totient is φ = 113230111020.
The previous prime is 113230110991. The next prime is 113230111091. The reversal of 113230111021 is 120111032311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109918108521 + 3312002500 = 331539^2 + 57550^2 .
It is a cyclic number.
It is not a de Polignac number, because 113230111021 - 225 = 113196556589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113230110986 and 113230111004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113230111091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56615055510 + 56615055511.
It is an arithmetic number, because the mean of its divisors is an integer number (56615055511).
Almost surely, 2113230111021 is an apocalyptic number.
It is an amenable number.
113230111021 is a deficient number, since it is larger than the sum of its proper divisors (1).
113230111021 is an equidigital number, since it uses as much as digits as its factorization.
113230111021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 113230111021 its reverse (120111032311), we get a palindrome (233341143332).
The spelling of 113230111021 in words is "one hundred thirteen billion, two hundred thirty million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •