Base | Representation |
---|---|
bin | 10111001111100001101111… |
… | …111101010111010011010001 |
3 | 111101221100002220111111011211 |
4 | 113033201233331113103101 |
5 | 101344301330100031001 |
6 | 1001224103501340121 |
7 | 30350205634414120 |
oct | 2717415775272321 |
9 | 441840086444154 |
10 | 102222100002001 |
11 | 2a631170587821 |
12 | b56b3b2567641 |
13 | 450666c492b35 |
14 | 1b3580c915ab7 |
15 | bc4071005351 |
hex | 5cf86ff574d1 |
102222100002001 has 8 divisors (see below), whose sum is σ = 120853714288320. Its totient is φ = 84597600001488.
The previous prime is 102222100001939. The next prime is 102222100002007. The reversal of 102222100002001 is 100200001222201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102222100002001 - 235 = 102187740263633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222100002007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 251778571231 + ... + 251778571636.
It is an arithmetic number, because the mean of its divisors is an integer number (15106714286040).
Almost surely, 2102222100002001 is an apocalyptic number.
It is an amenable number.
102222100002001 is a deficient number, since it is larger than the sum of its proper divisors (18631614286319).
102222100002001 is an equidigital number, since it uses as much as digits as its factorization.
102222100002001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 503557142903.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102222100002001 its reverse (100200001222201), we get a palindrome (202422101224202).
The spelling of 102222100002001 in words is "one hundred two trillion, two hundred twenty-two billion, one hundred million, two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •