Base | Representation |
---|---|
bin | 11101110011110001011101… |
… | …001000101110000111001111 |
3 | 122012012010222011022001000200 |
4 | 131303301131020232013033 |
5 | 114140430120420411343 |
6 | 1142455011222024543 |
7 | 36420513400001433 |
oct | 3563613510560717 |
9 | 565163864261020 |
10 | 131101144310223 |
11 | 3885575718844a |
12 | 12854343b78153 |
13 | 581ca284567a9 |
14 | 245348761a9c3 |
15 | 10253957344d3 |
hex | 773c5d22e1cf |
131101144310223 has 24 divisors (see below), whose sum is σ = 190049021828640. Its totient is φ = 87086614836480.
The previous prime is 131101144310219. The next prime is 131101144310243. The reversal of 131101144310223 is 322013441101131.
131101144310223 is a `hidden beast` number, since 1 + 3 + 1 + 1 + 0 + 1 + 1 + 4 + 431 + 0 + 223 = 666.
It is not a de Polignac number, because 131101144310223 - 22 = 131101144310219 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131101144310243) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 70933990 + ... + 72758732.
It is an arithmetic number, because the mean of its divisors is an integer number (7918709242860).
Almost surely, 2131101144310223 is an apocalyptic number.
131101144310223 is a deficient number, since it is larger than the sum of its proper divisors (58947877518417).
131101144310223 is a wasteful number, since it uses less digits than its factorization.
131101144310223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1853439 (or 1853436 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
Adding to 131101144310223 its reverse (322013441101131), we get a palindrome (453114585411354).
The spelling of 131101144310223 in words is "one hundred thirty-one trillion, one hundred one billion, one hundred forty-four million, three hundred ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •