Base | Representation |
---|---|
bin | 10001011110100010011… |
… | …000011110010001010110 |
3 | 11020211001011101122022110 |
4 | 101132202120132101112 |
5 | 124134142132400042 |
6 | 2315424023011450 |
7 | 152525254155066 |
oct | 21364230362126 |
9 | 4224034348273 |
10 | 1201020200022 |
11 | 423393657505 |
12 | 174923299b86 |
13 | 89342a78366 |
14 | 421b5c133a6 |
15 | 2139455c09c |
hex | 117a261e456 |
1201020200022 has 32 divisors (see below), whose sum is σ = 2467428554592. Its totient is φ = 389446147584.
The previous prime is 1201020199979. The next prime is 1201020200027. The reversal of 1201020200022 is 2200020201021.
It is a junction number, because it is equal to n+sod(n) for n = 1201020199980 and 1201020200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201020200027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 665268 + ... + 1686600.
It is an arithmetic number, because the mean of its divisors is an integer number (77107142331).
Almost surely, 21201020200022 is an apocalyptic number.
1201020200022 is an abundant number, since it is smaller than the sum of its proper divisors (1266408354570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201020200022 is a wasteful number, since it uses less digits than its factorization.
1201020200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026672.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1201020200022 its reverse (2200020201021), we get a palindrome (3401040401043).
Subtracting 1201020200022 from its reverse (2200020201021), we obtain a palindrome (999000000999).
The spelling of 1201020200022 in words is "one trillion, two hundred one billion, twenty million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •