Base | Representation |
---|---|
bin | 10011001100010000… |
… | …00101100000011100 |
3 | 222121001112102010010 |
4 | 21212020011200130 |
5 | 132100123032312 |
6 | 4422220043220 |
7 | 513216601641 |
oct | 114610054034 |
9 | 28531472103 |
10 | 10303330332 |
11 | 4407a63639 |
12 | 1bb6693510 |
13 | c827b3089 |
14 | 6da561dc8 |
15 | 40482893c |
hex | 26620581c |
10303330332 has 48 divisors (see below), whose sum is σ = 25254835200. Its totient is φ = 3263059008.
The previous prime is 10303330313. The next prime is 10303330339. The reversal of 10303330332 is 23303330301.
It is a super-2 number, since 2×103033303322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10303330299 and 10303330308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303330339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84148 + ... + 166395.
It is an arithmetic number, because the mean of its divisors is an integer number (526142400).
Almost surely, 210303330332 is an apocalyptic number.
10303330332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10303330332 is an abundant number, since it is smaller than the sum of its proper divisors (14951504868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10303330332 is a wasteful number, since it uses less digits than its factorization.
10303330332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250722 (or 250720 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 21.
Adding to 10303330332 its reverse (23303330301), we get a palindrome (33606660633).
The spelling of 10303330332 in words is "ten billion, three hundred three million, three hundred thirty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •