Base | Representation |
---|---|
bin | 10111000001001111010110… |
… | …010110010110000000011111 |
3 | 111021110110211111201121222201 |
4 | 113001033112112112000133 |
5 | 101232210033200044201 |
6 | 555153045455552331 |
7 | 30216240163653133 |
oct | 2701172626260037 |
9 | 437413744647881 |
10 | 101240270315551 |
11 | 2a2928372a0394 |
12 | b43106182b6a7 |
13 | 4464bbb7b9823 |
14 | 1b000ab7913c3 |
15 | ba8759a8a801 |
hex | 5c13d659601f |
101240270315551 has 2 divisors, whose sum is σ = 101240270315552. Its totient is φ = 101240270315550.
The previous prime is 101240270315543. The next prime is 101240270315617. The reversal of 101240270315551 is 155513072042101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101240270315551 - 23 = 101240270315543 is a prime.
It is a super-2 number, since 2×1012402703155512 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101240270315551.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101240270315501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50620135157775 + 50620135157776.
It is an arithmetic number, because the mean of its divisors is an integer number (50620135157776).
Almost surely, 2101240270315551 is an apocalyptic number.
101240270315551 is a deficient number, since it is larger than the sum of its proper divisors (1).
101240270315551 is an equidigital number, since it uses as much as digits as its factorization.
101240270315551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 37.
The spelling of 101240270315551 in words is "one hundred one trillion, two hundred forty billion, two hundred seventy million, three hundred fifteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •