Base | Representation |
---|---|
bin | 10111000010011001110… |
… | …010011100100011011011 |
3 | 12121100022220211022112001 |
4 | 113002121302130203123 |
5 | 201414221243300011 |
6 | 3211140133301431 |
7 | 222243250563241 |
oct | 27023162344333 |
9 | 5540286738461 |
10 | 1583128103131 |
11 | 5604455a6673 |
12 | 2169a2494877 |
13 | b6399635c03 |
14 | 568a3a36791 |
15 | 2b2aa2b37c1 |
hex | 17099c9c8db |
1583128103131 has 2 divisors, whose sum is σ = 1583128103132. Its totient is φ = 1583128103130.
The previous prime is 1583128103113. The next prime is 1583128103233. The reversal of 1583128103131 is 1313018213851.
Together with previous prime (1583128103113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1583128103131 - 237 = 1445689149659 is a prime.
It is a super-2 number, since 2×15831281031312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1583128103101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 791564051565 + 791564051566.
It is an arithmetic number, because the mean of its divisors is an integer number (791564051566).
Almost surely, 21583128103131 is an apocalyptic number.
1583128103131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1583128103131 is an equidigital number, since it uses as much as digits as its factorization.
1583128103131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 37.
The spelling of 1583128103131 in words is "one trillion, five hundred eighty-three billion, one hundred twenty-eight million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •