Base | Representation |
---|---|
bin | 11101110100001111100110… |
… | …011110101100011001010110 |
3 | 122012022020112000022002220110 |
4 | 131310033212132230121112 |
5 | 114141442413402220042 |
6 | 1142521523202143450 |
7 | 36423040464022413 |
oct | 3564174636543126 |
9 | 565266460262813 |
10 | 131133513320022 |
11 | 38868457697614 |
12 | 1285a678351b86 |
13 | 5822ab6576925 |
14 | 2454c7853910a |
15 | 102613c31209c |
hex | 7743e67ac656 |
131133513320022 has 8 divisors (see below), whose sum is σ = 262267026640056. Its totient is φ = 43711171106672.
The previous prime is 131133513320003. The next prime is 131133513320023. The reversal of 131133513320022 is 220023315331131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
131133513320022 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131133513320023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10927792776663 + ... + 10927792776674.
It is an arithmetic number, because the mean of its divisors is an integer number (32783378330007).
Almost surely, 2131133513320022 is an apocalyptic number.
131133513320022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131133513320022 is a wasteful number, since it uses less digits than its factorization.
131133513320022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21855585553342.
The product of its (nonzero) digits is 9720, while the sum is 30.
Adding to 131133513320022 its reverse (220023315331131), we get a palindrome (351156828651153).
The spelling of 131133513320022 in words is "one hundred thirty-one trillion, one hundred thirty-three billion, five hundred thirteen million, three hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •