Base | Representation |
---|---|
bin | 10011110110110100… |
… | …10111100100010001 |
3 | 1000111221111200120022 |
4 | 21323122113210101 |
5 | 133313033210213 |
6 | 4521454153225 |
7 | 525114165632 |
oct | 117332274421 |
9 | 30457450508 |
10 | 10660444433 |
11 | 45805a7761 |
12 | 20961b2815 |
13 | 100b78a3b2 |
14 | 731b61889 |
15 | 425d6a308 |
hex | 27b697911 |
10660444433 has 8 divisors (see below), whose sum is σ = 10973565288. Its totient is φ = 10351471104.
The previous prime is 10660444397. The next prime is 10660444453. The reversal of 10660444433 is 33444406601.
It can be written as a sum of positive squares in 4 ways, for example, as 4592501824 + 6067942609 = 67768^2 + 77897^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10660444433 is a prime.
It is a super-2 number, since 2×106604444332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10660444393 and 10660444402.
It is not an unprimeable number, because it can be changed into a prime (10660444453) 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, 1031666 + ... + 1041947.
It is an arithmetic number, because the mean of its divisors is an integer number (1371695661).
Almost surely, 210660444433 is an apocalyptic number.
It is an amenable number.
10660444433 is a deficient number, since it is larger than the sum of its proper divisors (313120855).
10660444433 is an equidigital number, since it uses as much as digits as its factorization.
10660444433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2073763.
The product of its (nonzero) digits is 82944, while the sum is 35.
The spelling of 10660444433 in words is "ten billion, six hundred sixty million, four hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •