Base | Representation |
---|---|
bin | 11101111010000011110101… |
… | …101110010100010000001100 |
3 | 122020201110011221020121112210 |
4 | 131322003311232110100030 |
5 | 114220014443431012304 |
6 | 1143425303545030420 |
7 | 36463650224355336 |
oct | 3572036556242014 |
9 | 566643157217483 |
10 | 131533201032204 |
11 | 38a01a0aa12504 |
12 | 12904022a85410 |
13 | 58516b22a417a |
14 | 246a35304a456 |
15 | 10317315c0c89 |
hex | 77a0f5b9440c |
131533201032204 has 24 divisors (see below), whose sum is σ = 314396431736688. Its totient is φ = 42775024725760.
The previous prime is 131533201032199. The next prime is 131533201032217. The reversal of 131533201032204 is 402230102335131.
It is a super-2 number, since 2×1315332010322042 (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 7 ways as a sum of consecutive naturals, for example, 133671951777 + ... + 133671952760.
It is an arithmetic number, because the mean of its divisors is an integer number (13099851322362).
Almost surely, 2131533201032204 is an apocalyptic number.
It is an amenable number.
131533201032204 is an abundant number, since it is smaller than the sum of its proper divisors (182863230704484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131533201032204 is a wasteful number, since it uses less digits than its factorization.
131533201032204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267343904585 (or 267343904583 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 131533201032204 its reverse (402230102335131), we get a palindrome (533763303367335).
The spelling of 131533201032204 in words is "one hundred thirty-one trillion, five hundred thirty-three billion, two hundred one million, thirty-two thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •