Base | Representation |
---|---|
bin | 11111000000000000011… |
… | …011101000101110101011 |
3 | 21112122201001000201122221 |
4 | 133000000123220232223 |
5 | 234400334110223111 |
6 | 4310352410254511 |
7 | 306624043633405 |
oct | 37000033505653 |
9 | 7478631021587 |
10 | 2130311023531 |
11 | 751507043559 |
12 | 2a4a50a27437 |
13 | 125b6c9c63a2 |
14 | 7517139bb75 |
15 | 3a6332cb371 |
hex | 1f0006e8bab |
2130311023531 has 2 divisors, whose sum is σ = 2130311023532. Its totient is φ = 2130311023530.
The previous prime is 2130311023507. The next prime is 2130311023541. The reversal of 2130311023531 is 1353201130312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2130311023531 - 29 = 2130311023019 is a prime.
It is a super-2 number, since 2×21303110235312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2130311023496 and 2130311023505.
It is not a weakly prime, because it can be changed into another prime (2130311023501) 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 as a sum of consecutive naturals, namely, 1065155511765 + 1065155511766.
It is an arithmetic number, because the mean of its divisors is an integer number (1065155511766).
Almost surely, 22130311023531 is an apocalyptic number.
2130311023531 is a deficient number, since it is larger than the sum of its proper divisors (1).
2130311023531 is an equidigital number, since it uses as much as digits as its factorization.
2130311023531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 2130311023531 its reverse (1353201130312), we get a palindrome (3483512153843).
The spelling of 2130311023531 in words is "two trillion, one hundred thirty billion, three hundred eleven million, twenty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •