Base | Representation |
---|---|
bin | 101111100000001011… |
… | …0001111010011110001 |
3 | 100202022100021010111002 |
4 | 1133000112033103301 |
5 | 3132404343200103 |
6 | 114510252131345 |
7 | 10240635525044 |
oct | 1370026172361 |
9 | 322270233432 |
10 | 102011303153 |
11 | 3a2987a2a11 |
12 | 1792b466b55 |
13 | 9809413856 |
14 | 4d1a21cc5b |
15 | 29c0ad1488 |
hex | 17c058f4f1 |
102011303153 has 2 divisors, whose sum is σ = 102011303154. Its totient is φ = 102011303152.
The previous prime is 102011303117. The next prime is 102011303159. The reversal of 102011303153 is 351303110201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77789672464 + 24221630689 = 278908^2 + 155633^2 .
It is a cyclic number.
It is not a de Polignac number, because 102011303153 - 236 = 33291826417 is a prime.
It is not a weakly prime, because it can be changed into another prime (102011303159) 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, 51005651576 + 51005651577.
It is an arithmetic number, because the mean of its divisors is an integer number (51005651577).
Almost surely, 2102011303153 is an apocalyptic number.
It is an amenable number.
102011303153 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011303153 is an equidigital number, since it uses as much as digits as its factorization.
102011303153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 102011303153 its reverse (351303110201), we get a palindrome (453314413354).
The spelling of 102011303153 in words is "one hundred two billion, eleven million, three hundred three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •