Base | Representation |
---|---|
bin | 111100110011110… |
… | …011000001110000 |
3 | 2122002201002211011 |
4 | 330303303001300 |
5 | 4042133230222 |
6 | 245122400304 |
7 | 34165440001 |
oct | 7463630160 |
9 | 2562632734 |
10 | 1020211312 |
11 | 48397894a |
12 | 245800094 |
13 | 133495843 |
14 | 996cd1a8 |
15 | 5e874c77 |
hex | 3ccf3070 |
1020211312 has 20 divisors (see below), whose sum is σ = 1978092640. Its totient is φ = 509735808.
The previous prime is 1020211307. The next prime is 1020211319. The reversal of 1020211312 is 2131120201.
1020211312 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10202113122 = 2081662242265522688, which contains 22 as substring.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 1020211292 and 1020211301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020211319) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 364 + ... + 45172.
It is an arithmetic number, because the mean of its divisors is an integer number (98904632).
Almost surely, 21020211312 is an apocalyptic number.
It is an amenable number.
1020211312 is a deficient number, since it is larger than the sum of its proper divisors (957881328).
1020211312 is a wasteful number, since it uses less digits than its factorization.
1020211312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46240 (or 46234 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1020211312 is about 31940.7468917056. The cubic root of 1020211312 is about 1006.6922183087.
Adding to 1020211312 its reverse (2131120201), we get a palindrome (3151331513).
The spelling of 1020211312 in words is "one billion, twenty million, two hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •