Base | Representation |
---|---|
bin | 101111100111000100… |
… | …0001111100011010001 |
3 | 100202220110022220201111 |
4 | 1133032020033203101 |
5 | 3133343040441103 |
6 | 114545231533321 |
7 | 10246444016362 |
oct | 1371610174321 |
9 | 322813286644 |
10 | 102242515153 |
11 | 3a3a7263a09 |
12 | 1799498a241 |
13 | 98452a869c |
14 | 4d3cc07b69 |
15 | 29d605386d |
hex | 17ce20f8d1 |
102242515153 has 2 divisors, whose sum is σ = 102242515154. Its totient is φ = 102242515152.
The previous prime is 102242515093. The next prime is 102242515189. The reversal of 102242515153 is 351515242201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96327674689 + 5914840464 = 310367^2 + 76908^2 .
It is a cyclic number.
It is not a de Polignac number, because 102242515153 - 221 = 102240418001 is a prime.
It is a super-2 number, since 2×1022425151532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102242516153) 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, 51121257576 + 51121257577.
It is an arithmetic number, because the mean of its divisors is an integer number (51121257577).
Almost surely, 2102242515153 is an apocalyptic number.
It is an amenable number.
102242515153 is a deficient number, since it is larger than the sum of its proper divisors (1).
102242515153 is an equidigital number, since it uses as much as digits as its factorization.
102242515153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 102242515153 its reverse (351515242201), we get a palindrome (453757757354).
The spelling of 102242515153 in words is "one hundred two billion, two hundred forty-two million, five hundred fifteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •