Base | Representation |
---|---|
bin | 111101000011101101… |
… | …1010101110001110101 |
3 | 110112110001111112121100 |
4 | 1322013123111301311 |
5 | 4122014001011013 |
6 | 140123004240313 |
7 | 12321206022006 |
oct | 1720733256165 |
9 | 415401445540 |
10 | 131121110133 |
11 | 506764a2832 |
12 | 214b4240099 |
13 | c498237000 |
14 | 64bc3411ad |
15 | 36264b9473 |
hex | 1e876d5c75 |
131121110133 has 24 divisors (see below), whose sum is σ = 205173102680. Its totient is φ = 80689901760.
The previous prime is 131121110117. The next prime is 131121110179. The reversal of 131121110133 is 331011121131.
131121110133 is a `hidden beast` number, since 1 + 311 + 211 + 10 + 133 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 32761724004 + 98359386129 = 181002^2 + 313623^2 .
It is not a de Polignac number, because 131121110133 - 24 = 131121110117 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131121110033) 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, 3295888 + ... + 3335433.
Almost surely, 2131121110133 is an apocalyptic number.
131121110133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131121110133 is a deficient number, since it is larger than the sum of its proper divisors (74051992547).
131121110133 is an equidigital number, since it uses as much as digits as its factorization.
131121110133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6631366 (or 6631337 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 131121110133 its reverse (331011121131), we get a palindrome (462132231264).
The spelling of 131121110133 in words is "one hundred thirty-one billion, one hundred twenty-one million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •