Base | Representation |
---|---|
bin | 11001110101110101101101… |
… | …111001101110000000000111 |
3 | 112220101221000202020111211221 |
4 | 121311311231321232000013 |
5 | 104344024143201413011 |
6 | 1041414311511541211 |
7 | 32640004033115566 |
oct | 3165655571560007 |
9 | 486357022214757 |
10 | 113650973466631 |
11 | 3323811a713397 |
12 | 108b63a108a807 |
13 | 4b553190a8623 |
14 | 200ca44c0dbdd |
15 | d214c8d58971 |
hex | 675d6de6e007 |
113650973466631 has 2 divisors, whose sum is σ = 113650973466632. Its totient is φ = 113650973466630.
The previous prime is 113650973466497. The next prime is 113650973466689. The reversal of 113650973466631 is 136664379056311.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113650973466631 - 215 = 113650973433863 is a prime.
It is a super-3 number, since 3×1136509734666313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 113650973466631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113650973460631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56825486733315 + 56825486733316.
It is an arithmetic number, because the mean of its divisors is an integer number (56825486733316).
Almost surely, 2113650973466631 is an apocalyptic number.
113650973466631 is a deficient number, since it is larger than the sum of its proper divisors (1).
113650973466631 is an equidigital number, since it uses as much as digits as its factorization.
113650973466631 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 44089920, while the sum is 61.
The spelling of 113650973466631 in words is "one hundred thirteen trillion, six hundred fifty billion, nine hundred seventy-three million, four hundred sixty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •