Base | Representation |
---|---|
bin | 11101110010010011100011… |
… | …100110011001110001000010 |
3 | 122011211111201121111101002011 |
4 | 131302103203212121301002 |
5 | 114132302124140214132 |
6 | 1142340414445043134 |
7 | 36410314035126652 |
oct | 3562234346316102 |
9 | 564744647441064 |
10 | 131000321023042 |
11 | 38816a19056519 |
12 | 128388a65564aa |
13 | 581337b1cc793 |
14 | 244c6410cc362 |
15 | 10229440c2b47 |
hex | 7724e3999c42 |
131000321023042 has 8 divisors (see below), whose sum is σ = 196500652457616. Its totient is φ = 65500103537172.
The previous prime is 131000321023031. The next prime is 131000321023073. The reversal of 131000321023042 is 240320123000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1310003210230422 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 25552608 + ... + 30247915.
It is an arithmetic number, because the mean of its divisors is an integer number (24562581557202).
Almost surely, 2131000321023042 is an apocalyptic number.
131000321023042 is a deficient number, since it is larger than the sum of its proper divisors (65500331434574).
131000321023042 is a wasteful number, since it uses less digits than its factorization.
131000321023042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56974352.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 131000321023042 its reverse (240320123000131), we get a palindrome (371320444023173).
The spelling of 131000321023042 in words is "one hundred thirty-one trillion, three hundred twenty-one million, twenty-three thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •