Base | Representation |
---|---|
bin | 101100100101111… |
… | …000101101110101 |
3 | 1221010201220020201 |
4 | 230211320231311 |
5 | 3013010113031 |
6 | 202123000501 |
7 | 24352664344 |
oct | 5445705565 |
9 | 1833656221 |
10 | 748129141 |
11 | 354332551 |
12 | 18a669131 |
13 | bbcc1086 |
14 | 71505b5b |
15 | 45a2cd61 |
hex | 2c978b75 |
748129141 has 2 divisors, whose sum is σ = 748129142. Its totient is φ = 748129140.
The previous prime is 748129117. The next prime is 748129229. The reversal of 748129141 is 141921847.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 444324241 + 303804900 = 21079^2 + 17430^2 .
It is a cyclic number.
It is not a de Polignac number, because 748129141 - 219 = 747604853 is a prime.
It is a super-2 number, since 2×7481291412 = 1119394423226795762, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 748129141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (748159141) 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, 374064570 + 374064571.
It is an arithmetic number, because the mean of its divisors is an integer number (374064571).
Almost surely, 2748129141 is an apocalyptic number.
It is an amenable number.
748129141 is a deficient number, since it is larger than the sum of its proper divisors (1).
748129141 is an equidigital number, since it uses as much as digits as its factorization.
748129141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 16128, while the sum is 37.
The square root of 748129141 is about 27351.9494917638. The cubic root of 748129141 is about 907.8042059577.
The spelling of 748129141 in words is "seven hundred forty-eight million, one hundred twenty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •