Base | Representation |
---|---|
bin | 10010101001011001… |
… | …11100100101001011 |
3 | 221211200110122200201 |
4 | 21110230330211023 |
5 | 131000304100321 |
6 | 4333214313031 |
7 | 503040060166 |
oct | 112454744513 |
9 | 27750418621 |
10 | 10011003211 |
11 | 4277a4a980 |
12 | 1b347b8777 |
13 | c37070851 |
14 | 6ad7c8add |
15 | 3d8d33291 |
hex | 254b3c94b |
10011003211 has 8 divisors (see below), whose sum is σ = 10922370048. Its totient is φ = 9099849000.
The previous prime is 10011003199. The next prime is 10011003241. The reversal of 10011003211 is 11230011001.
10011003211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10011003211 - 27 = 10011003083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011003241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54846 + ... + 151756.
It is an arithmetic number, because the mean of its divisors is an integer number (1365296256).
Almost surely, 210011003211 is an apocalyptic number.
10011003211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10011003211 is a deficient number, since it is larger than the sum of its proper divisors (911366837).
10011003211 is an equidigital number, since it uses as much as digits as its factorization.
10011003211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106313.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 10011003211 its reverse (11230011001), we get a palindrome (21241014212).
The spelling of 10011003211 in words is "ten billion, eleven million, three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •