Base | Representation |
---|---|
bin | 110000000101001111… |
… | …1100001111000001101 |
3 | 100212112000222022011212 |
4 | 1200022133201320031 |
5 | 3142431321034433 |
6 | 115233530224205 |
7 | 10313522110361 |
oct | 1401237417015 |
9 | 325460868155 |
10 | 103255252493 |
11 | 3a876997518 |
12 | 18017b85065 |
13 | 9977055353 |
14 | 4dd750d2a1 |
15 | 2a44dedd48 |
hex | 180a7e1e0d |
103255252493 has 2 divisors, whose sum is σ = 103255252494. Its totient is φ = 103255252492.
The previous prime is 103255252481. The next prime is 103255252531. The reversal of 103255252493 is 394252552301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64761597289 + 38493655204 = 254483^2 + 196198^2 .
It is a cyclic number.
It is not a de Polignac number, because 103255252493 - 210 = 103255251469 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 103255252493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103255257493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51627626246 + 51627626247.
It is an arithmetic number, because the mean of its divisors is an integer number (51627626247).
Almost surely, 2103255252493 is an apocalyptic number.
It is an amenable number.
103255252493 is a deficient number, since it is larger than the sum of its proper divisors (1).
103255252493 is an equidigital number, since it uses as much as digits as its factorization.
103255252493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 103255252493 in words is "one hundred three billion, two hundred fifty-five million, two hundred fifty-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •