Base | Representation |
---|---|
bin | 10011001111011011… |
… | …10111010101111011 |
3 | 222122220201221010010 |
4 | 21213231313111323 |
5 | 132123440323003 |
6 | 4425011553003 |
7 | 513662434104 |
oct | 114755672573 |
9 | 28586657103 |
10 | 10330011003 |
11 | 4421027184 |
12 | 20035bb763 |
13 | c88195260 |
14 | 6ddd093ab |
15 | 406d49003 |
hex | 267b7757b |
10330011003 has 8 divisors (see below), whose sum is σ = 14832836368. Its totient is φ = 6356929824.
The previous prime is 10330011001. The next prime is 10330011011. The reversal of 10330011003 is 30011003301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10330011003 - 21 = 10330011001 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 10330011003.
It is not an unprimeable number, because it can be changed into a prime (10330011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132436000 + ... + 132436077.
It is an arithmetic number, because the mean of its divisors is an integer number (1854104546).
Almost surely, 210330011003 is an apocalyptic number.
10330011003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10330011003 is a deficient number, since it is larger than the sum of its proper divisors (4502825365).
10330011003 is a wasteful number, since it uses less digits than its factorization.
10330011003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264872093.
The product of its (nonzero) digits is 27, while the sum is 12.
Adding to 10330011003 its reverse (30011003301), we get a palindrome (40341014304).
The spelling of 10330011003 in words is "ten billion, three hundred thirty million, eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •