Base | Representation |
---|---|
bin | 10011010110100001… |
… | …01110010011000001 |
3 | 222211001122022010022 |
4 | 21223100232103001 |
5 | 132234201340031 |
6 | 4434534343225 |
7 | 515314062011 |
oct | 115320562301 |
9 | 28731568108 |
10 | 10389480641 |
11 | 4451655641 |
12 | 201b4bab15 |
13 | c975b79a7 |
14 | 707b89c41 |
15 | 40c19497b |
hex | 26b42e4c1 |
10389480641 has 2 divisors, whose sum is σ = 10389480642. Its totient is φ = 10389480640.
The previous prime is 10389480571. The next prime is 10389480667. The reversal of 10389480641 is 14608498301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7889880625 + 2499600016 = 88825^2 + 49996^2 .
It is a cyclic number.
It is not a de Polignac number, because 10389480641 - 222 = 10385286337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10389480592 and 10389480601.
It is not a weakly prime, because it can be changed into another prime (10389480841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5194740320 + 5194740321.
It is an arithmetic number, because the mean of its divisors is an integer number (5194740321).
Almost surely, 210389480641 is an apocalyptic number.
It is an amenable number.
10389480641 is a deficient number, since it is larger than the sum of its proper divisors (1).
10389480641 is an equidigital number, since it uses as much as digits as its factorization.
10389480641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 44.
The spelling of 10389480641 in words is "ten billion, three hundred eighty-nine million, four hundred eighty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •