Base | Representation |
---|---|
bin | 10011001111100101… |
… | …10101000001001000 |
3 | 222200000012001000121 |
4 | 21213302311001020 |
5 | 132124303442300 |
6 | 4425055513024 |
7 | 514006463506 |
oct | 114762650110 |
9 | 28600161017 |
10 | 10331312200 |
11 | 4421835850 |
12 | 2003b28774 |
13 | c8852c5b1 |
14 | 700167676 |
15 | 40700481a |
hex | 267cb5048 |
10331312200 has 96 divisors (see below), whose sum is σ = 26231312160. Its totient is φ = 3752921600.
The previous prime is 10331312197. The next prime is 10331312209. The reversal of 10331312200 is 221313301.
It is not an unprimeable number, because it can be changed into a prime (10331312209) 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, 2873604 + ... + 2877196.
It is an arithmetic number, because the mean of its divisors is an integer number (273242835).
Almost surely, 210331312200 is an apocalyptic number.
10331312200 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 10331312200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13115656080).
10331312200 is an abundant number, since it is smaller than the sum of its proper divisors (15899999960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10331312200 is a wasteful number, since it uses less digits than its factorization.
10331312200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4927 (or 4918 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10331312200 its reverse (221313301), we get a palindrome (10552625501).
The spelling of 10331312200 in words is "ten billion, three hundred thirty-one million, three hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •