Base | Representation |
---|---|
bin | 101111100110011101… |
… | …0000100010101110001 |
3 | 100202212000202202101212 |
4 | 1133030322010111301 |
5 | 3133322314201001 |
6 | 114543220405505 |
7 | 10246104564521 |
oct | 1371472042561 |
9 | 322760682355 |
10 | 102222022001 |
11 | 3a396737120 |
12 | 17989b46895 |
13 | 9840c81968 |
14 | 4d3a1d1681 |
15 | 29d43567bb |
hex | 17cce84571 |
102222022001 has 8 divisors (see below), whose sum is σ = 111520797600. Its totient is φ = 92924223840.
The previous prime is 102222021977. The next prime is 102222022039. The reversal of 102222022001 is 100220222201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102222022001 - 210 = 102222020977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222022901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16436 + ... + 452453.
It is an arithmetic number, because the mean of its divisors is an integer number (13940099700).
Almost surely, 2102222022001 is an apocalyptic number.
102222022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102222022001 is a deficient number, since it is larger than the sum of its proper divisors (9298775599).
102222022001 is a wasteful number, since it uses less digits than its factorization.
102222022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488719.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 102222022001 its reverse (100220222201), we get a palindrome (202442244202).
The spelling of 102222022001 in words is "one hundred two billion, two hundred twenty-two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •