Base | Representation |
---|---|
bin | 111101000110110000… |
… | …0011100001000111010 |
3 | 110112201011102200101200 |
4 | 1322031200130020322 |
5 | 4122221104011302 |
6 | 140141050355030 |
7 | 12323555014212 |
oct | 1721540341072 |
9 | 415634380350 |
10 | 131223110202 |
11 | 5071902aa08 |
12 | 2152242ba76 |
13 | c4b33cac92 |
14 | 64cbad3242 |
15 | 363041681c |
hex | 1e8d81c23a |
131223110202 has 36 divisors (see below), whose sum is σ = 292208711886. Its totient is φ = 42558838560.
The previous prime is 131223110201. The next prime is 131223110219. The reversal of 131223110202 is 202011322131.
131223110202 is a `hidden beast` number, since 131 + 22 + 311 + 0 + 202 = 666.
It can be written as a sum of positive squares in 3 ways, for example, as 124885198881 + 6337911321 = 353391^2 + 79611^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (131223110201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 2637949 + ... + 2687232.
Almost surely, 2131223110202 is an apocalyptic number.
131223110202 is an abundant number, since it is smaller than the sum of its proper divisors (160985601684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131223110202 is a wasteful number, since it uses less digits than its factorization.
131223110202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5325263 (or 5325223 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 131223110202 its reverse (202011322131), we get a palindrome (333234432333).
The spelling of 131223110202 in words is "one hundred thirty-one billion, two hundred twenty-three million, one hundred ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •