Base | Representation |
---|---|
bin | 11101110010010011010010… |
… | …010001011110000101001110 |
3 | 122011211110222100111021121202 |
4 | 131302103102101132011032 |
5 | 114132301030230314042 |
6 | 1142340325542225502 |
7 | 36410303605203020 |
oct | 3562232221360516 |
9 | 564743870437552 |
10 | 131000030323022 |
11 | 38816889a54273 |
12 | 12838825125292 |
13 | 5813332c09a33 |
14 | 244c61465a010 |
15 | 10229287ee632 |
hex | 7724d245e14e |
131000030323022 has 32 divisors (see below), whose sum is σ = 227070070223808. Its totient is φ = 55519158537216.
The previous prime is 131000030322943. The next prime is 131000030323027. The reversal of 131000030323022 is 220323030000131.
It is a super-2 number, since 2×1310000303230222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131000030322985 and 131000030323003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131000030323027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37311833 + ... + 40671524.
It is an arithmetic number, because the mean of its divisors is an integer number (7095939694494).
Almost surely, 2131000030323022 is an apocalyptic number.
131000030323022 is a deficient number, since it is larger than the sum of its proper divisors (96070039900786).
131000030323022 is a wasteful number, since it uses less digits than its factorization.
131000030323022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77984700.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 131000030323022 its reverse (220323030000131), we get a palindrome (351323060323153).
The spelling of 131000030323022 in words is "one hundred thirty-one trillion, thirty million, three hundred twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •