Base | Representation |
---|---|
bin | 10011001100001111… |
… | …11110100111110100 |
3 | 222121001110222102200 |
4 | 21212013332213310 |
5 | 132100121132012 |
6 | 4422215304500 |
7 | 513216423504 |
oct | 114607764764 |
9 | 28531428380 |
10 | 10303302132 |
11 | 4407a44432 |
12 | 1bb667b130 |
13 | c827a32a6 |
14 | 6da555a04 |
15 | 4048203dc |
hex | 2661fe9f4 |
10303302132 has 72 divisors (see below), whose sum is σ = 28249151112. Its totient is φ = 3153561600.
The previous prime is 10303302103. The next prime is 10303302133. The reversal of 10303302132 is 23120330301.
It can be written as a sum of positive squares in 4 ways, for example, as 2512415376 + 7790886756 = 50124^2 + 88266^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10303302133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 180219 + ... + 230402.
It is an arithmetic number, because the mean of its divisors is an integer number (392349321).
Almost surely, 210303302132 is an apocalyptic number.
10303302132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10303302132 is an abundant number, since it is smaller than the sum of its proper divisors (17945848980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10303302132 is a wasteful number, since it uses less digits than its factorization.
10303302132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 410689 (or 410684 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 10303302132 its reverse (23120330301), we get a palindrome (33423632433).
The spelling of 10303302132 in words is "ten billion, three hundred three million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •