Base | Representation |
---|---|
bin | 100100001001110… |
… | …0111000010110100 |
3 | 10010112122212122111 |
4 | 1020103213002310 |
5 | 4441023201322 |
6 | 320212540404 |
7 | 42030116212 |
oct | 11023470264 |
9 | 3115585574 |
10 | 1213100212 |
11 | 572844165 |
12 | 29a321704 |
13 | 16443019c |
14 | b717dcb2 |
15 | 71777177 |
hex | 484e70b4 |
1213100212 has 24 divisors (see below), whose sum is σ = 2249500680. Its totient is φ = 570439680.
The previous prime is 1213100183. The next prime is 1213100233. The reversal of 1213100212 is 2120013121.
It can be written as a sum of positive squares in 4 ways, for example, as 490888336 + 722211876 = 22156^2 + 26874^2 .
It is a super-2 number, since 2×12131002122 = 2943224248708889888, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1213100192 and 1213100201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95262 + ... + 107242.
It is an arithmetic number, because the mean of its divisors is an integer number (93729195).
Almost surely, 21213100212 is an apocalyptic number.
It is an amenable number.
1213100212 is a deficient number, since it is larger than the sum of its proper divisors (1036400468).
1213100212 is a wasteful number, since it uses less digits than its factorization.
1213100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13491 (or 13489 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1213100212 is about 34829.5881686821. The cubic root of 1213100212 is about 1066.5115412867.
Adding to 1213100212 its reverse (2120013121), we get a palindrome (3333113333).
The spelling of 1213100212 in words is "one billion, two hundred thirteen million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •