Base | Representation |
---|---|
bin | 10010110111111110… |
… | …11110001100100000 |
3 | 222011012120222100102 |
4 | 21123333132030200 |
5 | 131223111100000 |
6 | 4353303441532 |
7 | 506053425455 |
oct | 113377361440 |
9 | 28135528312 |
10 | 10133300000 |
11 | 432aa902aa |
12 | 1b697562a8 |
13 | c564c0005 |
14 | 6c1b4182c |
15 | 3e493e3d5 |
hex | 25bfde320 |
10133300000 has 72 divisors (see below), whose sum is σ = 24936068052. Its totient is φ = 4053280000.
The previous prime is 10133299991. The next prime is 10133300029. The reversal of 10133300000 is 333101.
It can be written as a sum of positive squares in 6 ways, for example, as 212343184 + 9920956816 = 14572^2 + 99604^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49334 + ... + 150666.
Almost surely, 210133300000 is an apocalyptic number.
10133300000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10133300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12468034026).
10133300000 is an abundant number, since it is smaller than the sum of its proper divisors (14802768052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10133300000 is an frugal number, since it uses more digits than its factorization.
10133300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101368 (or 101340 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 11.
Adding to 10133300000 its reverse (333101), we get a palindrome (10133633101).
The spelling of 10133300000 in words is "ten billion, one hundred thirty-three million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •