Base | Representation |
---|---|
bin | 111101000001010011… |
… | …0101100010101100001 |
3 | 110112020102020212210222 |
4 | 1322002212230111201 |
5 | 4121332242400113 |
6 | 140110554132425 |
7 | 12316204215341 |
oct | 1720246542541 |
9 | 415212225728 |
10 | 131040200033 |
11 | 5063485a886 |
12 | 21491121115 |
13 | c484548602 |
14 | 64b16bcd21 |
15 | 361e335e08 |
hex | 1e829ac561 |
131040200033 has 8 divisors (see below), whose sum is σ = 131452717440. Its totient is φ = 130627783440.
The previous prime is 131040200021. The next prime is 131040200051. The reversal of 131040200033 is 330002040131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131040200033 - 216 = 131040134497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131040199984 and 131040200020.
It is not an unprimeable number, because it can be changed into a prime (131040200063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3236591 + ... + 3276827.
It is an arithmetic number, because the mean of its divisors is an integer number (16431589680).
Almost surely, 2131040200033 is an apocalyptic number.
It is an amenable number.
131040200033 is a deficient number, since it is larger than the sum of its proper divisors (412517407).
131040200033 is an equidigital number, since it uses as much as digits as its factorization.
131040200033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50407.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 131040200033 its reverse (330002040131), we get a palindrome (461042240164).
The spelling of 131040200033 in words is "one hundred thirty-one billion, forty million, two hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •