Base | Representation |
---|---|
bin | 10111001111100001110001… |
… | …110100000100111110110111 |
3 | 111101221100012002001112221012 |
4 | 113033201301310010332313 |
5 | 101344301411031401403 |
6 | 1001224110532342435 |
7 | 30350206463056226 |
oct | 2717416164047667 |
9 | 441840162045835 |
10 | 102222131122103 |
11 | 2a631187102813 |
12 | b56b400a74a1b |
13 | 4506675a6a8b5 |
14 | 1b35812ad6cbd |
15 | bc4073b00ed8 |
hex | 5cf871d04fb7 |
102222131122103 has 16 divisors (see below), whose sum is σ = 105920118374400. Its totient is φ = 98549232255840.
The previous prime is 102222131122079. The next prime is 102222131122123. The reversal of 102222131122103 is 301221131222201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102222131122103 is a prime.
It is a super-2 number, since 2×1022221311221032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102222131122123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 108295658 + ... + 109235496.
It is an arithmetic number, because the mean of its divisors is an integer number (6620007398400).
Almost surely, 2102222131122103 is an apocalyptic number.
102222131122103 is a deficient number, since it is larger than the sum of its proper divisors (3697987252297).
102222131122103 is a wasteful number, since it uses less digits than its factorization.
102222131122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 953182.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 102222131122103 its reverse (301221131222201), we get a palindrome (403443262344304).
The spelling of 102222131122103 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred thirty-one million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •