Base | Representation |
---|---|
bin | 101111100010110110… |
… | …1001011000101000110 |
3 | 100202112121102102110012 |
4 | 1133011231023011012 |
5 | 3133100401414342 |
6 | 114523223030222 |
7 | 10243106614406 |
oct | 1370555130506 |
9 | 322477372405 |
10 | 102101201222 |
11 | 3a334514739 |
12 | 1795559b372 |
13 | 9821c2b287 |
14 | 4d28140806 |
15 | 29c893cb82 |
hex | 17c5b4b146 |
102101201222 has 4 divisors (see below), whose sum is σ = 153151801836. Its totient is φ = 51050600610.
The previous prime is 102101201207. The next prime is 102101201269. The reversal of 102101201222 is 222102101201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 222102101201 = 73 ⋅3042494537.
It is a junction number, because it is equal to n+sod(n) for n = 102101201197 and 102101201206.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25525300304 + ... + 25525300307.
It is an arithmetic number, because the mean of its divisors is an integer number (38287950459).
Almost surely, 2102101201222 is an apocalyptic number.
102101201222 is a deficient number, since it is larger than the sum of its proper divisors (51050600614).
102101201222 is an equidigital number, since it uses as much as digits as its factorization.
102101201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51050600613.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102101201222 its reverse (222102101201), we get a palindrome (324203302423).
It can be divided in two parts, 102101201 and 222, that multiplied together give a palindrome (22666466622).
The spelling of 102101201222 in words is "one hundred two billion, one hundred one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •