Base | Representation |
---|---|
bin | 111101000001000010… |
… | …0010111100110110110 |
3 | 110112012210022202011000 |
4 | 1322002010113212312 |
5 | 4121322441432410 |
6 | 140110033224130 |
7 | 12316034561565 |
oct | 1720204274666 |
9 | 415183282130 |
10 | 131031202230 |
11 | 5062a774685 |
12 | 2148a102046 |
13 | c482717c76 |
14 | 64b0419bdc |
15 | 361d659dc0 |
hex | 1e821179b6 |
131031202230 has 64 divisors (see below), whose sum is σ = 349992622080. Its totient is φ = 34884045792.
The previous prime is 131031202217. The next prime is 131031202231. The reversal of 131031202230 is 32202130131.
131031202230 is a `hidden beast` number, since 1 + 310 + 3 + 120 + 2 + 230 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131031202231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 235864 + ... + 563643.
It is an arithmetic number, because the mean of its divisors is an integer number (5468634720).
Almost surely, 2131031202230 is an apocalyptic number.
131031202230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131031202230 is an abundant number, since it is smaller than the sum of its proper divisors (218961419850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131031202230 is a wasteful number, since it uses less digits than its factorization.
131031202230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 800130 (or 800124 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 131031202230 its reverse (32202130131), we get a palindrome (163233332361).
The spelling of 131031202230 in words is "one hundred thirty-one billion, thirty-one million, two hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •