Base | Representation |
---|---|
bin | 10011001111101100… |
… | …10000111101101100 |
3 | 222200001212210211021 |
4 | 21213312100331230 |
5 | 132130021304400 |
6 | 4425131103524 |
7 | 514020235156 |
oct | 114766207554 |
9 | 28601783737 |
10 | 10332213100 |
11 | 44222a06a0 |
12 | 20042a1ba4 |
13 | c88786681 |
14 | 70031dad6 |
15 | 40713171a |
hex | 267d90f6c |
10332213100 has 36 divisors (see below), whose sum is σ = 24459168888. Its totient is φ = 3757168000.
The previous prime is 10332213083. The next prime is 10332213103. The reversal of 10332213100 is 131223301.
It is a super-2 number, since 2×103322131002 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10332213103) by changing a digit.
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, 4695361 + ... + 4697560.
It is an arithmetic number, because the mean of its divisors is an integer number (679421358).
Almost surely, 210332213100 is an apocalyptic number.
10332213100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10332213100 is an abundant number, since it is smaller than the sum of its proper divisors (14126955788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10332213100 is a wasteful number, since it uses less digits than its factorization.
10332213100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9392946 (or 9392939 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 10332213100 its reverse (131223301), we get a palindrome (10463436401).
The spelling of 10332213100 in words is "ten billion, three hundred thirty-two million, two hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •