Base | Representation |
---|---|
bin | 11001110010101001000100… |
… | …001011101110101111110111 |
3 | 112212121220211110112122001200 |
4 | 121302221010023232233313 |
5 | 104331424124413304421 |
6 | 1041125330543223543 |
7 | 32615064425225646 |
oct | 3162510413565767 |
9 | 485556743478050 |
10 | 113431230213111 |
11 | 33162a07344648 |
12 | 1087b8955a7bb3 |
13 | 4b3a699646c25 |
14 | 200215a99b35d |
15 | d1a917481726 |
hex | 672a442eebf7 |
113431230213111 has 12 divisors (see below), whose sum is σ = 164147966341320. Its totient is φ = 75481040434320.
The previous prime is 113431230213107. The next prime is 113431230213113. The reversal of 113431230213111 is 111312032134311.
113431230213111 is a `hidden beast` number, since 1 + 1 + 3 + 4 + 312 + 30 + 2 + 1 + 311 + 1 = 666.
It is not a de Polignac number, because 113431230213111 - 22 = 113431230213107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113431230213113) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11648303841 + ... + 11648313578.
It is an arithmetic number, because the mean of its divisors is an integer number (13678997195110).
Almost surely, 2113431230213111 is an apocalyptic number.
113431230213111 is a deficient number, since it is larger than the sum of its proper divisors (50716736128209).
113431230213111 is a wasteful number, since it uses less digits than its factorization.
113431230213111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23296617966 (or 23296617963 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
Adding to 113431230213111 its reverse (111312032134311), we get a palindrome (224743262347422).
The spelling of 113431230213111 in words is "one hundred thirteen trillion, four hundred thirty-one billion, two hundred thirty million, two hundred thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •