Base | Representation |
---|---|
bin | 11001110000111010000001… |
… | …101000001100100100110111 |
3 | 112212012112002020121220210112 |
4 | 121300322001220030210313 |
5 | 104323000440003014312 |
6 | 1040554452021013235 |
7 | 32603344020156422 |
oct | 3160720150144467 |
9 | 485175066556715 |
10 | 113312002001207 |
11 | 33117394101329 |
12 | 1086076025421b |
13 | 4b2c378315609 |
14 | 1dda489d589b9 |
15 | d1778a12dd22 |
hex | 670e81a0c937 |
113312002001207 has 4 divisors (see below), whose sum is σ = 113312258494656. Its totient is φ = 113311745507760.
The previous prime is 113312002001197. The next prime is 113312002001257. The reversal of 113312002001207 is 702100200213311.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113312002001207 - 230 = 113310928259383 is a prime.
It is a super-4 number, since 4×1133120020012074 (a number of 57 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113312002001257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 127582919 + ... + 128467992.
It is an arithmetic number, because the mean of its divisors is an integer number (28328064623664).
Almost surely, 2113312002001207 is an apocalyptic number.
113312002001207 is a deficient number, since it is larger than the sum of its proper divisors (256493449).
113312002001207 is an equidigital number, since it uses as much as digits as its factorization.
113312002001207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256493448.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 113312002001207 its reverse (702100200213311), we get a palindrome (815412202214518).
The spelling of 113312002001207 in words is "one hundred thirteen trillion, three hundred twelve billion, two million, one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •