Base | Representation |
---|---|
bin | 11101011101011010001… |
… | …00101110100011110011 |
3 | 10120202201102102011120221 |
4 | 32232231010232203303 |
5 | 113041012034342321 |
6 | 2053001413113511 |
7 | 133062531433153 |
oct | 16565504564363 |
9 | 3522642364527 |
10 | 1012221012211 |
11 | 36030a411292 |
12 | 144212928897 |
13 | 745b5163706 |
14 | 36dc5556763 |
15 | 1b4e45e1e41 |
hex | ebad12e8f3 |
1012221012211 has 16 divisors (see below), whose sum is σ = 1097989185888. Its totient is φ = 929370419200.
The previous prime is 1012221012169. The next prime is 1012221012241. The reversal of 1012221012211 is 1122101222101.
It is not a de Polignac number, because 1012221012211 - 29 = 1012221011699 is a prime.
It is a super-2 number, since 2×10122210122112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012221012241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10296651 + ... + 10394491.
It is an arithmetic number, because the mean of its divisors is an integer number (68624324118).
Almost surely, 21012221012211 is an apocalyptic number.
1012221012211 is a deficient number, since it is larger than the sum of its proper divisors (85768173677).
1012221012211 is a wasteful number, since it uses less digits than its factorization.
1012221012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112742.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1012221012211 its reverse (1122101222101), we get a palindrome (2134322234312).
It can be divided in two parts, 10 and 12221012211, that added together give a palindrome (12221012221).
The spelling of 1012221012211 in words is "one trillion, twelve billion, two hundred twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •