Base | Representation |
---|---|
bin | 110100111100101001… |
… | …0110100100010100111 |
3 | 101212111020101002212022 |
4 | 1221321102310202213 |
5 | 3330331224023011 |
6 | 124122430013355 |
7 | 11133460062314 |
oct | 1517122644247 |
9 | 355436332768 |
10 | 113704126631 |
11 | 44249019297 |
12 | 1a05334725b |
13 | a950a36c04 |
14 | 5709119d0b |
15 | 2e573c68db |
hex | 1a794b48a7 |
113704126631 has 2 divisors, whose sum is σ = 113704126632. Its totient is φ = 113704126630.
The previous prime is 113704126619. The next prime is 113704126741. The reversal of 113704126631 is 136621407311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113704126631 - 218 = 113703864487 is a prime.
It is a super-2 number, since 2×1137041266312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 113704126591 and 113704126600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113704626631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56852063315 + 56852063316.
It is an arithmetic number, because the mean of its divisors is an integer number (56852063316).
Almost surely, 2113704126631 is an apocalyptic number.
113704126631 is a deficient number, since it is larger than the sum of its proper divisors (1).
113704126631 is an equidigital number, since it uses as much as digits as its factorization.
113704126631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 35.
The spelling of 113704126631 in words is "one hundred thirteen billion, seven hundred four million, one hundred twenty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •