Base | Representation |
---|---|
bin | 10111001111100001110000… |
… | …101011100001011001110011 |
3 | 111101221100010202021020021001 |
4 | 113033201300223201121303 |
5 | 101344301341144231003 |
6 | 1001224105012542431 |
7 | 30350206142311105 |
oct | 2717416053413163 |
9 | 441840122236231 |
10 | 102222112102003 |
11 | 2a6311773a1723 |
12 | b56b3b6621a17 |
13 | 4506671b3b4ba |
14 | 1b35810385575 |
15 | bc40720e561d |
hex | 5cf870ae1673 |
102222112102003 has 4 divisors (see below), whose sum is σ = 102225561735528. Its totient is φ = 102218662468480.
The previous prime is 102222112101973. The next prime is 102222112102043. The reversal of 102222112102003 is 300201211222201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102222112102003 - 233 = 102213522167411 is a prime.
It is a super-2 number, since 2×1022221121020032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222112102043) 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, 1724772313 + ... + 1724831578.
It is an arithmetic number, because the mean of its divisors is an integer number (25556390433882).
Almost surely, 2102222112102003 is an apocalyptic number.
102222112102003 is a deficient number, since it is larger than the sum of its proper divisors (3449633525).
102222112102003 is an equidigital number, since it uses as much as digits as its factorization.
102222112102003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3449633524.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102222112102003 its reverse (300201211222201), we get a palindrome (402423323324204).
The spelling of 102222112102003 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred twelve million, one hundred two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •