Base | Representation |
---|---|
bin | 10100000000111111… |
… | …10010111101000101 |
3 | 1000201220000211111011 |
4 | 22000133302331011 |
5 | 134001403102123 |
6 | 4534142442221 |
7 | 530201253103 |
oct | 120037627505 |
9 | 30656024434 |
10 | 10745753413 |
11 | 461477464a |
12 | 20ba893371 |
13 | 1023359095 |
14 | 73d20ac73 |
15 | 42d5bbe0d |
hex | 2807f2f45 |
10745753413 has 2 divisors, whose sum is σ = 10745753414. Its totient is φ = 10745753412.
The previous prime is 10745753401. The next prime is 10745753423. The reversal of 10745753413 is 31435754701.
10745753413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5797756449 + 4947996964 = 76143^2 + 70342^2 .
It is a cyclic number.
It is not a de Polignac number, because 10745753413 - 213 = 10745745221 is a prime.
It is a super-2 number, since 2×107457534132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10745753423) 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, 5372876706 + 5372876707.
It is an arithmetic number, because the mean of its divisors is an integer number (5372876707).
Almost surely, 210745753413 is an apocalyptic number.
It is an amenable number.
10745753413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10745753413 is an equidigital number, since it uses as much as digits as its factorization.
10745753413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 176400, while the sum is 40.
The spelling of 10745753413 in words is "ten billion, seven hundred forty-five million, seven hundred fifty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •