Base | Representation |
---|---|
bin | 10011010110100001… |
… | …01010110100011001 |
3 | 222211001121120120121 |
4 | 21223100222310121 |
5 | 132234200411033 |
6 | 4434534153241 |
7 | 515314002325 |
oct | 115320526431 |
9 | 28731546517 |
10 | 10389466393 |
11 | 4451645969 |
12 | 201b4b2821 |
13 | c975b1367 |
14 | 707b84985 |
15 | 40c19062d |
hex | 26b42ad19 |
10389466393 has 4 divisors (see below), whose sum is σ = 10670262820. Its totient is φ = 10108669968.
The previous prime is 10389466391. The next prime is 10389466441. The reversal of 10389466393 is 39366498301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 39366498301 = 13 ⋅3028192177.
It can be written as a sum of positive squares in 2 ways, for example, as 9910600704 + 478865689 = 99552^2 + 21883^2 .
It is a cyclic number.
It is not a de Polignac number, because 10389466393 - 21 = 10389466391 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10389466393.
It is not an unprimeable number, because it can be changed into a prime (10389466391) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140398158 + ... + 140398231.
It is an arithmetic number, because the mean of its divisors is an integer number (2667565705).
Almost surely, 210389466393 is an apocalyptic number.
It is an amenable number.
10389466393 is a deficient number, since it is larger than the sum of its proper divisors (280796427).
10389466393 is an equidigital number, since it uses as much as digits as its factorization.
10389466393 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 280796426.
The product of its (nonzero) digits is 2519424, while the sum is 52.
The spelling of 10389466393 in words is "ten billion, three hundred eighty-nine million, four hundred sixty-six thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •