Base | Representation |
---|---|
bin | 11001110000111010111110… |
… | …111110010001111001000001 |
3 | 112212012121201222020122120020 |
4 | 121300322332332101321001 |
5 | 104323010041441402241 |
6 | 1040555142104204053 |
7 | 32603411355212061 |
oct | 3160727676217101 |
9 | 485177658218506 |
10 | 113313031200321 |
11 | 33117872058907 |
12 | 108609a8a69629 |
13 | 4b2c4b0607084 |
14 | 1dda5469073a1 |
15 | d177ea67bb66 |
hex | 670ebef91e41 |
113313031200321 has 8 divisors (see below), whose sum is σ = 151866860469600. Its totient is φ = 75150611365632.
The previous prime is 113313031200293. The next prime is 113313031200331. The reversal of 113313031200321 is 123002130313311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113313031200321 - 213 = 113313031192129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113313031200291 and 113313031200300.
It is not an unprimeable number, because it can be changed into a prime (113313031200331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97852357971 + ... + 97852359128.
It is an arithmetic number, because the mean of its divisors is an integer number (18983357558700).
Almost surely, 2113313031200321 is an apocalyptic number.
It is an amenable number.
113313031200321 is a deficient number, since it is larger than the sum of its proper divisors (38553829269279).
113313031200321 is a wasteful number, since it uses less digits than its factorization.
113313031200321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195704717295.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 113313031200321 its reverse (123002130313311), we get a palindrome (236315161513632).
The spelling of 113313031200321 in words is "one hundred thirteen trillion, three hundred thirteen billion, thirty-one million, two hundred thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •