Base | Representation |
---|---|
bin | 10100010010100100… |
… | …10011011100101001 |
3 | 1001010011111110212022 |
4 | 22021102103130221 |
5 | 134302130231213 |
6 | 5000531154225 |
7 | 533641524626 |
oct | 121122233451 |
9 | 31104443768 |
10 | 10893211433 |
11 | 468aa2aa85 |
12 | 2140145975 |
13 | 1047a77c50 |
14 | 754a3334d |
15 | 43b4e8308 |
hex | 289493729 |
10893211433 has 8 divisors (see below), whose sum is σ = 11734427208. Its totient is φ = 10052463744.
The previous prime is 10893211429. The next prime is 10893211463. The reversal of 10893211433 is 33411239801.
It can be written as a sum of positive squares in 4 ways, for example, as 1181503129 + 9711708304 = 34373^2 + 98548^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10893211433 - 22 = 10893211429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10893211393 and 10893211402.
It is not an unprimeable number, because it can be changed into a prime (10893211463) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67916 + ... + 162477.
It is an arithmetic number, because the mean of its divisors is an integer number (1466803401).
Almost surely, 210893211433 is an apocalyptic number.
10893211433 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10893211433 is a deficient number, since it is larger than the sum of its proper divisors (841215775).
10893211433 is a wasteful number, since it uses less digits than its factorization.
10893211433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234043.
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 10893211433 in words is "ten billion, eight hundred ninety-three million, two hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •