Base | Representation |
---|---|
bin | 10101110001101100000… |
… | …00101010001011111001 |
3 | 2122112022110121012210112 |
4 | 22320312000222023321 |
5 | 44224333443430321 |
6 | 1331422103154105 |
7 | 105025563622046 |
oct | 12706600521371 |
9 | 2575273535715 |
10 | 748230451961 |
11 | 269360647053 |
12 | 101018a45935 |
13 | 5573371c505 |
14 | 28300a081cd |
15 | 146e340ba5b |
hex | ae3602a2f9 |
748230451961 has 2 divisors, whose sum is σ = 748230451962. Its totient is φ = 748230451960.
The previous prime is 748230451889. The next prime is 748230451999. The reversal of 748230451961 is 169154032847.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 384945793600 + 363284658361 = 620440^2 + 602731^2 .
It is a cyclic number.
It is not a de Polignac number, because 748230451961 - 230 = 747156710137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (748230451061) 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, 374115225980 + 374115225981.
It is an arithmetic number, because the mean of its divisors is an integer number (374115225981).
It is a 1-persistent number, because it is pandigital, but 2⋅748230451961 = 1496460903922 is not.
Almost surely, 2748230451961 is an apocalyptic number.
It is an amenable number.
748230451961 is a deficient number, since it is larger than the sum of its proper divisors (1).
748230451961 is an equidigital number, since it uses as much as digits as its factorization.
748230451961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1451520, while the sum is 50.
The spelling of 748230451961 in words is "seven hundred forty-eight billion, two hundred thirty million, four hundred fifty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •