Base | Representation |
---|---|
bin | 101111100110001000… |
… | …0000110110010110001 |
3 | 100202211021001220020110 |
4 | 1133030100012302301 |
5 | 3133312010201001 |
6 | 114542144531533 |
7 | 10245612231534 |
oct | 1371420066261 |
9 | 322737056213 |
10 | 102211022001 |
11 | 3a390503710 |
12 | 17986320ba9 |
13 | 983b8ccb9a |
14 | 4d3896aa1b |
15 | 29d33d23d6 |
hex | 17cc406cb1 |
102211022001 has 16 divisors (see below), whose sum is σ = 148710582720. Its totient is φ = 61929405120.
The previous prime is 102211021993. The next prime is 102211022009. The reversal of 102211022001 is 100220112201.
It is an interprime number because it is at equal distance from previous prime (102211021993) and next prime (102211022009).
It is not a de Polignac number, because 102211022001 - 23 = 102211021993 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102211022009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 291666 + ... + 538043.
It is an arithmetic number, because the mean of its divisors is an integer number (9294411420).
Almost surely, 2102211022001 is an apocalyptic number.
102211022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102211022001 is a deficient number, since it is larger than the sum of its proper divisors (46499560719).
102211022001 is a wasteful number, since it uses less digits than its factorization.
102211022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 833456.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102211022001 its reverse (100220112201), we get a palindrome (202431134202).
The spelling of 102211022001 in words is "one hundred two billion, two hundred eleven million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •