Base | Representation |
---|---|
bin | 10011001100001101… |
… | …11100101111110111 |
3 | 222121000222021022022 |
4 | 21212012330233313 |
5 | 132100034013221 |
6 | 4422205423355 |
7 | 513214221035 |
oct | 114606745767 |
9 | 28530867268 |
10 | 10303032311 |
11 | 440787a740 |
12 | 1bb656ab5b |
13 | c8270a530 |
14 | 6da4c5555 |
15 | 4047ba4ab |
hex | 2661bcbf7 |
10303032311 has 32 divisors (see below), whose sum is σ = 12799696896. Its totient is φ = 8162784000.
The previous prime is 10303032287. The next prime is 10303032331. The reversal of 10303032311 is 11323030301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10303032311 is a prime.
It is a super-3 number, since 3×103030323113 (a number of 31 digits) contains 333 as substring.
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 10303032311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303032331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 153410 + ... + 210096.
It is an arithmetic number, because the mean of its divisors is an integer number (399990528).
Almost surely, 210303032311 is an apocalyptic number.
10303032311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10303032311 is a deficient number, since it is larger than the sum of its proper divisors (2496664585).
10303032311 is a wasteful number, since it uses less digits than its factorization.
10303032311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56783.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10303032311 its reverse (11323030301), we get a palindrome (21626062612).
The spelling of 10303032311 in words is "ten billion, three hundred three million, thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •