Base | Representation |
---|---|
bin | 11101110011110001100001… |
… | …111001101011101111110101 |
3 | 122012012011011201201121220002 |
4 | 131303301201321223233311 |
5 | 114140430301402120303 |
6 | 1142455023155321045 |
7 | 36420515360343125 |
oct | 3563614171535765 |
9 | 565164151647802 |
10 | 131101224254453 |
11 | 38855798320762 |
12 | 128543668b0185 |
13 | 581ca3bb9767b |
14 | 24534940aac85 |
15 | 102539c776788 |
hex | 773c61e6bbf5 |
131101224254453 has 8 divisors (see below), whose sum is σ = 134163267655968. Its totient is φ = 128060974756624.
The previous prime is 131101224254369. The next prime is 131101224254459. The reversal of 131101224254453 is 354452422101131.
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 131101224254453 - 224 = 131101207477237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131101224254459) 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, 5448463751 + ... + 5448487812.
It is an arithmetic number, because the mean of its divisors is an integer number (16770408456996).
Almost surely, 2131101224254453 is an apocalyptic number.
It is an amenable number.
131101224254453 is a deficient number, since it is larger than the sum of its proper divisors (3062043401515).
131101224254453 is a wasteful number, since it uses less digits than its factorization.
131101224254453 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10896951843.
The product of its (nonzero) digits is 115200, while the sum is 38.
Adding to 131101224254453 its reverse (354452422101131), we get a palindrome (485553646355584).
The spelling of 131101224254453 in words is "one hundred thirty-one trillion, one hundred one billion, two hundred twenty-four million, two hundred fifty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •