Base | Representation |
---|---|
bin | 11111000000110110000… |
… | …101010001011001000001 |
3 | 21112202000202201220012121 |
4 | 133000312011101121001 |
5 | 234404210022133213 |
6 | 4311022002524241 |
7 | 306655253465650 |
oct | 37006605213101 |
9 | 7482022656177 |
10 | 2131211130433 |
11 | 751929139160 |
12 | 2a5062366681 |
13 | 125c84329618 |
14 | 75218b45197 |
15 | 3a68732988d |
hex | 1f036151641 |
2131211130433 has 64 divisors (see below), whose sum is σ = 2756063232000. Its totient is φ = 1599360537600.
The previous prime is 2131211130413. The next prime is 2131211130481. The reversal of 2131211130433 is 3340311121312.
It is not a de Polignac number, because 2131211130433 - 29 = 2131211129921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2131211130398 and 2131211130407.
It is not an unprimeable number, because it can be changed into a prime (2131211130413) 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 63 ways as a sum of consecutive naturals, for example, 1001037513 + ... + 1001039641.
It is an arithmetic number, because the mean of its divisors is an integer number (43063488000).
Almost surely, 22131211130433 is an apocalyptic number.
It is an amenable number.
2131211130433 is a deficient number, since it is larger than the sum of its proper divisors (624852101567).
2131211130433 is a wasteful number, since it uses less digits than its factorization.
2131211130433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4006.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 2131211130433 its reverse (3340311121312), we get a palindrome (5471522251745).
The spelling of 2131211130433 in words is "two trillion, one hundred thirty-one billion, two hundred eleven million, one hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •