Base | Representation |
---|---|
bin | 111101000110101110… |
… | …0111101111110100111 |
3 | 110112201002201110011001 |
4 | 1322031130331332213 |
5 | 4122220340401411 |
6 | 140141015054131 |
7 | 12323544204223 |
oct | 1721534757647 |
9 | 415632643131 |
10 | 131222200231 |
11 | 50718569271 |
12 | 21522071347 |
13 | c4b316ca35 |
14 | 64cb937783 |
15 | 36302d6dc1 |
hex | 1e8d73dfa7 |
131222200231 has 8 divisors (see below), whose sum is σ = 135955017728. Its totient is φ = 126520623000.
The previous prime is 131222200171. The next prime is 131222200237. The reversal of 131222200231 is 132002222131.
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 131222200231 - 213 = 131222192039 is a prime.
It is a super-2 number, since 2×1312222002312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131222200199 and 131222200208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131222200237) 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, 7801515 + ... + 7818316.
It is an arithmetic number, because the mean of its divisors is an integer number (16994377216).
Almost surely, 2131222200231 is an apocalyptic number.
131222200231 is a deficient number, since it is larger than the sum of its proper divisors (4732817497).
131222200231 is a wasteful number, since it uses less digits than its factorization.
131222200231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15620133.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 131222200231 its reverse (132002222131), we get a palindrome (263224422362).
The spelling of 131222200231 in words is "one hundred thirty-one billion, two hundred twenty-two million, two hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •