Base | Representation |
---|---|
bin | 10011011000010010… |
… | …11000001100100100 |
3 | 222212002120211210122 |
4 | 21230021120030210 |
5 | 132302002113244 |
6 | 4440224541112 |
7 | 515554236251 |
oct | 115411301444 |
9 | 28762524718 |
10 | 10404332324 |
11 | 4459a79961 |
12 | 2024481798 |
13 | c9a6b7979 |
14 | 709b34428 |
15 | 40d62a1ee |
hex | 26c258324 |
10404332324 has 6 divisors (see below), whose sum is σ = 18207581574. Its totient is φ = 5202166160.
The previous prime is 10404332317. The next prime is 10404332329. The reversal of 10404332324 is 42323340401.
It can be written as a sum of positive squares in only one way, i.e., 10225254400 + 179077924 = 101120^2 + 13382^2 .
It is a super-2 number, since 2×104043323242 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10404332293 and 10404332302.
It is not an unprimeable number, because it can be changed into a prime (10404332329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1300541537 + ... + 1300541544.
It is an arithmetic number, because the mean of its divisors is an integer number (3034596929).
Almost surely, 210404332324 is an apocalyptic number.
It is an amenable number.
10404332324 is a deficient number, since it is larger than the sum of its proper divisors (7803249250).
10404332324 is a wasteful number, since it uses less digits than its factorization.
10404332324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2601083085 (or 2601083083 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 10404332324 its reverse (42323340401), we get a palindrome (52727672725).
The spelling of 10404332324 in words is "ten billion, four hundred four million, three hundred thirty-two thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •