Base | Representation |
---|---|
bin | 11001011110010001001011… |
… | …111101010110000101110010 |
3 | 112200200002010001011222111212 |
4 | 121132101023331112011302 |
5 | 104141004400014240310 |
6 | 1034134231241240122 |
7 | 32411662415054204 |
oct | 3136211375260562 |
9 | 480602101158455 |
10 | 112031201321330 |
11 | 32773190553555 |
12 | 10694492793042 |
13 | 4a6865ca65635 |
14 | 1d944a65d0774 |
15 | ce42c6a16205 |
hex | 65e44bf56172 |
112031201321330 has 16 divisors (see below), whose sum is σ = 201720445559640. Its totient is φ = 44798195377152.
The previous prime is 112031201321261. The next prime is 112031201321399. The reversal of 112031201321330 is 33123102130211.
It is an interprime number because it is at equal distance from previous prime (112031201321261) and next prime (112031201321399).
It can be written as a sum of positive squares in 4 ways, for example, as 110468108765161 + 1563092556169 = 10510381^2 + 1250237^2 .
It is a junction number, because it is equal to n+sod(n) for n = 112031201321296 and 112031201321305.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1785610985 + ... + 1785673724.
Almost surely, 2112031201321330 is an apocalyptic number.
112031201321330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112031201321330 is a deficient number, since it is larger than the sum of its proper divisors (89689244238310).
112031201321330 is a wasteful number, since it uses less digits than its factorization.
112031201321330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3571287853.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 112031201321330 its reverse (33123102130211), we get a palindrome (145154303451541).
The spelling of 112031201321330 in words is "one hundred twelve trillion, thirty-one billion, two hundred one million, three hundred twenty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •