Base | Representation |
---|---|
bin | 10111000000101010000001… |
… | …111110001110101010101110 |
3 | 111021022122101221100210201212 |
4 | 113000222001332032222232 |
5 | 101231031002200032342 |
6 | 555122421410034422 |
7 | 30213321203632166 |
oct | 2700520176165256 |
9 | 437278357323655 |
10 | 101200200002222 |
11 | 2a277844687962 |
12 | b42533a278a12 |
13 | 44611a3cb8c59 |
14 | 1adc189b1d5a6 |
15 | ba76b1d15182 |
hex | 5c0a81f8eaae |
101200200002222 has 4 divisors (see below), whose sum is σ = 151800300003336. Its totient is φ = 50600100001110.
The previous prime is 101200200002197. The next prime is 101200200002327. The reversal of 101200200002222 is 222200002002101.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 101200200002197 and 101200200002206.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 25300050000554 + ... + 25300050000557.
It is an arithmetic number, because the mean of its divisors is an integer number (37950075000834).
Almost surely, 2101200200002222 is an apocalyptic number.
101200200002222 is a deficient number, since it is larger than the sum of its proper divisors (50600100001114).
101200200002222 is an equidigital number, since it uses as much as digits as its factorization.
101200200002222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50600100001113.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 101200200002222 its reverse (222200002002101), we get a palindrome (323400202004323).
The spelling of 101200200002222 in words is "one hundred one trillion, two hundred billion, two hundred million, two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •