Base | Representation |
---|---|
bin | 10111011011001001000011… |
… | …001001011010000001100110 |
3 | 111111202122011201012221011101 |
4 | 113123021003021122001212 |
5 | 102000340343244214342 |
6 | 1003034455421430314 |
7 | 30461651615341213 |
oct | 2733110311320146 |
9 | 444678151187141 |
10 | 103020212101222 |
11 | 2a909698aaa739 |
12 | b67a01070b39a |
13 | 45639c2283b50 |
14 | 1b622c2242b0a |
15 | bd9bd36c93b7 |
hex | 5db24325a066 |
103020212101222 has 8 divisors (see below), whose sum is σ = 166417265702016. Its totient is φ = 47547790200552.
The previous prime is 103020212101211. The next prime is 103020212101229. The reversal of 103020212101222 is 222101212020301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030202121012222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103020212101222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103020212101229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1981157924998 + ... + 1981157925049.
It is an arithmetic number, because the mean of its divisors is an integer number (20802158212752).
Almost surely, 2103020212101222 is an apocalyptic number.
103020212101222 is a deficient number, since it is larger than the sum of its proper divisors (63397053600794).
103020212101222 is a wasteful number, since it uses less digits than its factorization.
103020212101222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3962315850062.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 103020212101222 its reverse (222101212020301), we get a palindrome (325121424121523).
The spelling of 103020212101222 in words is "one hundred three trillion, twenty billion, two hundred twelve million, one hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •