Base | Representation |
---|---|
bin | 11101110000000010001… |
… | …00010011001110110100 |
3 | 10121201112021111112012221 |
4 | 32320001010103032310 |
5 | 113222001322333022 |
6 | 2101333524452124 |
7 | 133565365443646 |
oct | 16700104231664 |
9 | 3551467445187 |
10 | 1022220121012 |
11 | 364580677772 |
12 | 14614354a044 |
13 | 755198cb33c |
14 | 37693526896 |
15 | 1b8cc375cc7 |
hex | ee011133b4 |
1022220121012 has 6 divisors (see below), whose sum is σ = 1788885211778. Its totient is φ = 511110060504.
The previous prime is 1022220120991. The next prime is 1022220121033. The reversal of 1022220121012 is 2101210222201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1022220120991) and next prime (1022220121033).
It can be written as a sum of positive squares in only one way, i.e., 712866130596 + 309353990416 = 844314^2 + 556196^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127777515123 + ... + 127777515130.
Almost surely, 21022220121012 is an apocalyptic number.
It is an amenable number.
1022220121012 is a deficient number, since it is larger than the sum of its proper divisors (766665090766).
1022220121012 is a wasteful number, since it uses less digits than its factorization.
1022220121012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255555030257 (or 255555030255 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1022220121012 its reverse (2101210222201), we get a palindrome (3123430343213).
It can be divided in two parts, 10222201 and 21012, that multiplied together give a palindrome (214788887412).
The spelling of 1022220121012 in words is "one trillion, twenty-two billion, two hundred twenty million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •