Base | Representation |
---|---|
bin | 10011011000010101… |
… | …00011111011111001 |
3 | 222212010011121100121 |
4 | 21230022203323321 |
5 | 132302042030203 |
6 | 4440235333241 |
7 | 515560000564 |
oct | 115412437371 |
9 | 28763147317 |
10 | 10404642553 |
11 | 445a170a48 |
12 | 20245b1221 |
13 | c9a795c36 |
14 | 709bb54db |
15 | 40d68c0bd |
hex | 26c2a3ef9 |
10404642553 has 4 divisors (see below), whose sum is σ = 10462126948. Its totient is φ = 10347158160.
The previous prime is 10404642551. The next prime is 10404642557. The reversal of 10404642553 is 35524640401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 35524640401 = 607 ⋅58524943.
It can be written as a sum of positive squares in 2 ways, for example, as 2357296704 + 8047345849 = 48552^2 + 89707^2 .
It is a cyclic number.
It is not a de Polignac number, because 10404642553 - 21 = 10404642551 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10404642551) 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 in 3 ways as a sum of consecutive naturals, for example, 28741926 + ... + 28742287.
It is an arithmetic number, because the mean of its divisors is an integer number (2615531737).
Almost surely, 210404642553 is an apocalyptic number.
It is an amenable number.
10404642553 is a deficient number, since it is larger than the sum of its proper divisors (57484395).
10404642553 is an equidigital number, since it uses as much as digits as its factorization.
10404642553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57484394.
The product of its (nonzero) digits is 57600, while the sum is 34.
The spelling of 10404642553 in words is "ten billion, four hundred four million, six hundred forty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •