Base | Representation |
---|---|
bin | 11001110000110001110111… |
… | …011000101100100100111111 |
3 | 112212011200110121210212221102 |
4 | 121300301313120230210333 |
5 | 104322330013444344411 |
6 | 1040550442345523315 |
7 | 32602613626306511 |
oct | 3160616730544477 |
9 | 485150417725842 |
10 | 113303240231231 |
11 | 331136a8334916 |
12 | 1085ab15aa353b |
13 | 4b2b5b001663b |
14 | 1dd9c98437bb1 |
15 | d17425d0dd3b |
hex | 670c7762c93f |
113303240231231 has 2 divisors, whose sum is σ = 113303240231232. Its totient is φ = 113303240231230.
The previous prime is 113303240231171. The next prime is 113303240231303. The reversal of 113303240231231 is 132132042303311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113303240231231 - 226 = 113303173122367 is a prime.
It is a super-2 number, since 2×1133032402312312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113303240231194 and 113303240231203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113303240231131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56651620115615 + 56651620115616.
It is an arithmetic number, because the mean of its divisors is an integer number (56651620115616).
Almost surely, 2113303240231231 is an apocalyptic number.
113303240231231 is a deficient number, since it is larger than the sum of its proper divisors (1).
113303240231231 is an equidigital number, since it uses as much as digits as its factorization.
113303240231231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 113303240231231 its reverse (132132042303311), we get a palindrome (245435282534542).
The spelling of 113303240231231 in words is "one hundred thirteen trillion, three hundred three billion, two hundred forty million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •