Base | Representation |
---|---|
bin | 10011001100000001… |
… | …10000111110000000 |
3 | 222120220220220120011 |
4 | 21212000300332000 |
5 | 132044130124300 |
6 | 4422110554304 |
7 | 513164356543 |
oct | 114600607600 |
9 | 28526826504 |
10 | 10301411200 |
11 | 4406972783 |
12 | 1bb5b08994 |
13 | c822906b2 |
14 | 6da1c285a |
15 | 404599eba |
hex | 266030f80 |
10301411200 has 96 divisors (see below), whose sum is σ = 25536881160. Its totient is φ = 4106127360.
The previous prime is 10301411191. The next prime is 10301411201. The reversal of 10301411200 is 211410301.
It is a super-2 number, since 2×103014112002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301411201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 932107 + ... + 943093.
Almost surely, 210301411200 is an apocalyptic number.
10301411200 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 10301411200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12768440580).
10301411200 is an abundant number, since it is smaller than the sum of its proper divisors (15235469960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301411200 is a wasteful number, since it uses less digits than its factorization.
10301411200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11304 (or 11287 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10301411200 its reverse (211410301), we get a palindrome (10512821501).
The spelling of 10301411200 in words is "ten billion, three hundred one million, four hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •