Base | Representation |
---|---|
bin | 10110111111101000110001… |
… | …010101011110010101111011 |
3 | 111021001221112110220020011122 |
4 | 112333220301111132111323 |
5 | 101223404000140231012 |
6 | 555030312252415455 |
7 | 30205260560611334 |
oct | 2677506125362573 |
9 | 437057473806148 |
10 | 101130127664507 |
11 | 2a250056678457 |
12 | b41384317758b |
13 | 44576b7894a26 |
14 | 1ad8a1d67728b |
15 | ba59601b5e72 |
hex | 5bfa3155e57b |
101130127664507 has 2 divisors, whose sum is σ = 101130127664508. Its totient is φ = 101130127664506.
The previous prime is 101130127664477. The next prime is 101130127664551. The reversal of 101130127664507 is 705466721031101.
It is an a-pointer prime, because the next prime (101130127664551) can be obtained adding 101130127664507 to its sum of digits (44).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101130127664507 - 222 = 101130123470203 is a prime.
It is not a weakly prime, because it can be changed into another prime (101130127664567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565063832253 + 50565063832254.
It is an arithmetic number, because the mean of its divisors is an integer number (50565063832254).
Almost surely, 2101130127664507 is an apocalyptic number.
101130127664507 is a deficient number, since it is larger than the sum of its proper divisors (1).
101130127664507 is an equidigital number, since it uses as much as digits as its factorization.
101130127664507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 211680, while the sum is 44.
Adding to 101130127664507 its reverse (705466721031101), we get a palindrome (806596848695608).
The spelling of 101130127664507 in words is "one hundred one trillion, one hundred thirty billion, one hundred twenty-seven million, six hundred sixty-four thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •