Base | Representation |
---|---|
bin | 11001101110001010000001… |
… | …011011000100110001000011 |
3 | 112211112110021202122120200110 |
4 | 121232022001123010301003 |
5 | 104311401421110002243 |
6 | 1040331555320522403 |
7 | 32553603614522004 |
oct | 3156120133046103 |
9 | 484473252576613 |
10 | 113123020000323 |
11 | 33054226751a23 |
12 | 1082bbba620403 |
13 | 4b175bb883558 |
14 | 1dd127d2b11ab |
15 | d128c9101e33 |
hex | 66e2816c4c43 |
113123020000323 has 8 divisors (see below), whose sum is σ = 150830760372048. Its totient is φ = 75415313147744.
The previous prime is 113123020000273. The next prime is 113123020000351. The reversal of 113123020000323 is 323000020321311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113123020000323 - 26 = 113123020000259 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113123020000323.
It is not an unprimeable number, because it can be changed into a prime (113123020070323) 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, 992365 + ... + 15074177.
It is an arithmetic number, because the mean of its divisors is an integer number (18853845046506).
Almost surely, 2113123020000323 is an apocalyptic number.
113123020000323 is a deficient number, since it is larger than the sum of its proper divisors (37707740371725).
113123020000323 is a wasteful number, since it uses less digits than its factorization.
113123020000323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16759573.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 113123020000323 its reverse (323000020321311), we get a palindrome (436123040321634).
The spelling of 113123020000323 in words is "one hundred thirteen trillion, one hundred twenty-three billion, twenty million, three hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •