Base | Representation |
---|---|
bin | 110000000101000110… |
… | …0011000010001110001 |
3 | 100212111200112020221201 |
4 | 1200022030120101301 |
5 | 3142424024414213 |
6 | 115233230451201 |
7 | 10313431331545 |
oct | 1401214302161 |
9 | 325450466851 |
10 | 103250232433 |
11 | 3a874078907 |
12 | 18016363b01 |
13 | 9975cb83ba |
14 | 4dd69a3a25 |
15 | 2a4475b6dd |
hex | 180a318471 |
103250232433 has 2 divisors, whose sum is σ = 103250232434. Its totient is φ = 103250232432.
The previous prime is 103250232427. The next prime is 103250232511. The reversal of 103250232433 is 334232052301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85259912049 + 17990320384 = 291993^2 + 134128^2 .
It is a cyclic number.
It is not a de Polignac number, because 103250232433 - 29 = 103250231921 is a prime.
It is a super-2 number, since 2×1032502324332 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103250232133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51625116216 + 51625116217.
It is an arithmetic number, because the mean of its divisors is an integer number (51625116217).
Almost surely, 2103250232433 is an apocalyptic number.
It is an amenable number.
103250232433 is a deficient number, since it is larger than the sum of its proper divisors (1).
103250232433 is an equidigital number, since it uses as much as digits as its factorization.
103250232433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 28.
Adding to 103250232433 its reverse (334232052301), we get a palindrome (437482284734).
The spelling of 103250232433 in words is "one hundred three billion, two hundred fifty million, two hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •