Base | Representation |
---|---|
bin | 10111001111100001111011… |
… | …111100100100011011001001 |
3 | 111101221100121220221100111001 |
4 | 113033201323330210123021 |
5 | 101344302233041321301 |
6 | 1001224135444135001 |
7 | 30350213626036423 |
oct | 2717417374443311 |
9 | 441840556840431 |
10 | 102222301120201 |
11 | 2a631264063909 |
12 | b56b449997461 |
13 | 45066a204c0a2 |
14 | 1b3582b509813 |
15 | bc40839d0c01 |
hex | 5cf87bf246c9 |
102222301120201 has 4 divisors (see below), whose sum is σ = 102222356294272. Its totient is φ = 102222245946132.
The previous prime is 102222301120169. The next prime is 102222301120271. The reversal of 102222301120201 is 102021103222201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102222301120201 - 25 = 102222301120169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222301120271) 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, 24707781 + ... + 28546786.
It is an arithmetic number, because the mean of its divisors is an integer number (25555589073568).
Almost surely, 2102222301120201 is an apocalyptic number.
It is an amenable number.
102222301120201 is a deficient number, since it is larger than the sum of its proper divisors (55174071).
102222301120201 is an equidigital number, since it uses as much as digits as its factorization.
102222301120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55174070.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102222301120201 its reverse (102021103222201), we get a palindrome (204243404342402).
The spelling of 102222301120201 in words is "one hundred two trillion, two hundred twenty-two billion, three hundred one million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •