Base | Representation |
---|---|
bin | 11001100011101100011010… |
… | …010110111000101001000001 |
3 | 112201222201110012120210022121 |
4 | 121203230122112320221001 |
5 | 104213111424003413101 |
6 | 1035021411002004241 |
7 | 32450631452506315 |
oct | 3143543226705101 |
9 | 481881405523277 |
10 | 112404031310401 |
11 | 328a7311342566 |
12 | 107347a27a6681 |
13 | 4a94868408b1c |
14 | 1da8554137b45 |
15 | cedd47e960a1 |
hex | 663b1a5b8a41 |
112404031310401 has 16 divisors (see below), whose sum is σ = 119431524186000. Its totient is φ = 105587069591808.
The previous prime is 112404031310387. The next prime is 112404031310453. The reversal of 112404031310401 is 104013130404211.
It can be written as a sum of positive squares in 8 ways, for example, as 10975465429776 + 101428565880625 = 3312924^2 + 10071175^2 .
It is a cyclic number.
It is not a de Polignac number, because 112404031310401 - 213 = 112404031302209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112404031380401) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10759075 + ... + 18454423.
It is an arithmetic number, because the mean of its divisors is an integer number (7464470261625).
Almost surely, 2112404031310401 is an apocalyptic number.
It is an amenable number.
112404031310401 is a deficient number, since it is larger than the sum of its proper divisors (7027492875599).
112404031310401 is a wasteful number, since it uses less digits than its factorization.
112404031310401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7709028.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 112404031310401 its reverse (104013130404211), we get a palindrome (216417161714612).
The spelling of 112404031310401 in words is "one hundred twelve trillion, four hundred four billion, thirty-one million, three hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •