Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …001101100111101111111110 |
3 | 111101111200110120001012102121 |
4 | 113031300032031213233332 |
5 | 101340302202424342342 |
6 | 1001052103531113154 |
7 | 30335332106200300 |
oct | 2715601615475776 |
9 | 441450416035377 |
10 | 102100201012222 |
11 | 2a5944a77a7566 |
12 | b54b8528a27ba |
13 | 44c8013a3999a |
14 | 1b2d9672c9970 |
15 | bc0cd9491067 |
hex | 5cdc0e367bfe |
102100201012222 has 96 divisors (see below), whose sum is σ = 189163397136384. Its totient is φ = 41144362257600.
The previous prime is 102100201012193. The next prime is 102100201012237. The reversal of 102100201012222 is 222210102001201.
It is a happy number.
It is a super-2 number, since 2×1021002010122222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102100201012196 and 102100201012205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 22905088 + ... + 26997100.
It is an arithmetic number, because the mean of its divisors is an integer number (1970452053504).
Almost surely, 2102100201012222 is an apocalyptic number.
102100201012222 is a deficient number, since it is larger than the sum of its proper divisors (87063196124162).
102100201012222 is a wasteful number, since it uses less digits than its factorization.
102100201012222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4092294 (or 4092287 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102100201012222 its reverse (222210102001201), we get a palindrome (324310303013423).
The spelling of 102100201012222 in words is "one hundred two trillion, one hundred billion, two hundred one million, twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •