Base | Representation |
---|---|
bin | 10110110110111011010000… |
… | …010110010110110001011111 |
3 | 111011221201101002102122210012 |
4 | 112312323100112112301133 |
5 | 101134102003003122201 |
6 | 553451311125233435 |
7 | 30114106201061612 |
oct | 2666732026266137 |
9 | 434851332378705 |
10 | 100531500051551 |
11 | 2a03a195a23628 |
12 | b337817b6287b |
13 | 441310636867a |
14 | 1ab7a71798179 |
15 | b950c5a865bb |
hex | 5b6ed0596c5f |
100531500051551 has 2 divisors, whose sum is σ = 100531500051552. Its totient is φ = 100531500051550.
The previous prime is 100531500051523. The next prime is 100531500051553. The reversal of 100531500051551 is 155150005135001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100531500051551 - 26 = 100531500051487 is a prime.
It is a super-2 number, since 2×1005315000515512 (a number of 29 digits) contains 22 as substring.
Together with 100531500051553, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100531500051553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50265750025775 + 50265750025776.
It is an arithmetic number, because the mean of its divisors is an integer number (50265750025776).
Almost surely, 2100531500051551 is an apocalyptic number.
100531500051551 is a deficient number, since it is larger than the sum of its proper divisors (1).
100531500051551 is an equidigital number, since it uses as much as digits as its factorization.
100531500051551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9375, while the sum is 32.
Adding to 100531500051551 its reverse (155150005135001), we get a palindrome (255681505186552).
The spelling of 100531500051551 in words is "one hundred trillion, five hundred thirty-one billion, five hundred million, fifty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •