Base | Representation |
---|---|
bin | 10110101111111001… |
… | …11001011110100100 |
3 | 1011112010220200120001 |
4 | 23113330321132210 |
5 | 200003012000400 |
6 | 5335514551044 |
7 | 611435534200 |
oct | 132774713644 |
9 | 34463820501 |
10 | 12213000100 |
11 | 51a7a13814 |
12 | 244a138484 |
13 | 11c83210a2 |
14 | 83c025b00 |
15 | 4b72e6a6a |
hex | 2d7f397a4 |
12213000100 has 108 divisors (see below), whose sum is σ = 30868868016. Its totient is φ = 4181916480.
The previous prime is 12213000097. The next prime is 12213000113. The reversal of 12213000100 is 100031221.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6403347 + ... + 6405253.
It is an arithmetic number, because the mean of its divisors is an integer number (285822852).
Almost surely, 212213000100 is an apocalyptic number.
12213000100 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 12213000100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15434434008).
12213000100 is an abundant number, since it is smaller than the sum of its proper divisors (18655867916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12213000100 is a wasteful number, since it uses less digits than its factorization.
12213000100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3242 (or 3228 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 12213000100 its reverse (100031221), we get a palindrome (12313031321).
The spelling of 12213000100 in words is "twelve billion, two hundred thirteen million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •