Base | Representation |
---|---|
bin | 111101001001000011… |
… | …0111110011100001001 |
3 | 110112220112201101202002 |
4 | 1322102012332130021 |
5 | 4122400340233113 |
6 | 140152445320345 |
7 | 12325513212530 |
oct | 1722206763411 |
9 | 415815641662 |
10 | 131300321033 |
11 | 50758676612 |
12 | 215442660b5 |
13 | c4c63c296b |
14 | 64d8071317 |
15 | 36370b8c58 |
hex | 1e921be709 |
131300321033 has 16 divisors (see below), whose sum is σ = 155967653760. Its totient is φ = 108147312000.
The previous prime is 131300321011. The next prime is 131300321063. The reversal of 131300321033 is 330123003131.
It is not a de Polignac number, because 131300321033 - 236 = 62580844297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131300320996 and 131300321014.
It is not an unprimeable number, because it can be changed into a prime (131300321063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1489868 + ... + 1575533.
It is an arithmetic number, because the mean of its divisors is an integer number (9747978360).
Almost surely, 2131300321033 is an apocalyptic number.
It is an amenable number.
131300321033 is a deficient number, since it is larger than the sum of its proper divisors (24667332727).
131300321033 is a wasteful number, since it uses less digits than its factorization.
131300321033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3065648.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 131300321033 its reverse (330123003131), we get a palindrome (461423324164).
The spelling of 131300321033 in words is "one hundred thirty-one billion, three hundred million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •