Base | Representation |
---|---|
bin | 11101110101100001011000… |
… | …110001100101010000001010 |
3 | 122012121122012010021211211222 |
4 | 131311201120301211100022 |
5 | 114144412241014020132 |
6 | 1143030125155122042 |
7 | 36432266614245116 |
oct | 3565413061452012 |
9 | 565548163254758 |
10 | 131221330220042 |
11 | 388a1720a81347 |
12 | 128736a5ba3322 |
13 | 582b17000396a |
14 | 2459209518746 |
15 | 102857bbae412 |
hex | 775858c6540a |
131221330220042 has 8 divisors (see below), whose sum is σ = 197655560164800. Its totient is φ = 65336143498444.
The previous prime is 131221330220041. The next prime is 131221330220047. The reversal of 131221330220042 is 240022033122131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1312213302200423 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131221330219993 and 131221330220020.
It is not an unprimeable number, because it can be changed into a prime (131221330220041) 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, 137260805192 + ... + 137260806147.
It is an arithmetic number, because the mean of its divisors is an integer number (24706945020600).
Almost surely, 2131221330220042 is an apocalyptic number.
131221330220042 is a deficient number, since it is larger than the sum of its proper divisors (66434229944758).
131221330220042 is a wasteful number, since it uses less digits than its factorization.
131221330220042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274521611580.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 131221330220042 its reverse (240022033122131), we get a palindrome (371243363342173).
The spelling of 131221330220042 in words is "one hundred thirty-one trillion, two hundred twenty-one billion, three hundred thirty million, two hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •