Base | Representation |
---|---|
bin | 10011100111101010… |
… | …11110000000111101 |
3 | 1000012002022122201120 |
4 | 21303311132000331 |
5 | 133033013043010 |
6 | 4501113501153 |
7 | 522011556561 |
oct | 116365360075 |
9 | 30162278646 |
10 | 10533331005 |
11 | 451587753a |
12 | 205b7117b9 |
13 | cbb342752 |
14 | 71cd136a1 |
15 | 419b0be70 |
hex | 273d5e03d |
10533331005 has 8 divisors (see below), whose sum is σ = 16853329632. Its totient is φ = 5617776528.
The previous prime is 10533330991. The next prime is 10533331013. The reversal of 10533331005 is 50013333501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10533331005 - 210 = 10533329981 is a prime.
It is a super-2 number, since 2×105333310052 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351111019 + ... + 351111048.
It is an arithmetic number, because the mean of its divisors is an integer number (2106666204).
Almost surely, 210533331005 is an apocalyptic number.
10533331005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10533331005 is a deficient number, since it is larger than the sum of its proper divisors (6319998627).
10533331005 is an equidigital number, since it uses as much as digits as its factorization.
10533331005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702222075.
The product of its (nonzero) digits is 2025, while the sum is 24.
Adding to 10533331005 its reverse (50013333501), we get a palindrome (60546664506).
The spelling of 10533331005 in words is "ten billion, five hundred thirty-three million, three hundred thirty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •