Base | Representation |
---|---|
bin | 1010100101100111000011110… |
… | …1110000111111100011011101 |
3 | 10121200222011120002112221001001 |
4 | 2221121300331300333203131 |
5 | 1240123220241311442213 |
6 | 11200322502332350301 |
7 | 312634252141426102 |
oct | 25131607560774335 |
9 | 3550864502487031 |
10 | 745040423155933 |
11 | 1a6435961787033 |
12 | 6b6899aa315391 |
13 | 25c95019c22158 |
14 | d1da212780aa9 |
15 | 5b20327aec1dd |
hex | 2a59c3dc3f8dd |
745040423155933 has 2 divisors, whose sum is σ = 745040423155934. Its totient is φ = 745040423155932.
The previous prime is 745040423155921. The next prime is 745040423155961. The reversal of 745040423155933 is 339551324040547.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 569284234263684 + 175756188892249 = 23859678^2 + 13257307^2 .
It is a cyclic number.
It is not a de Polignac number, because 745040423155933 - 29 = 745040423155421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (740040423155933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 372520211577966 + 372520211577967.
It is an arithmetic number, because the mean of its divisors is an integer number (372520211577967).
Almost surely, 2745040423155933 is an apocalyptic number.
It is an amenable number.
745040423155933 is a deficient number, since it is larger than the sum of its proper divisors (1).
745040423155933 is an equidigital number, since it uses as much as digits as its factorization.
745040423155933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216000, while the sum is 55.
The spelling of 745040423155933 in words is "seven hundred forty-five trillion, forty billion, four hundred twenty-three million, one hundred fifty-five thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •