Base | Representation |
---|---|
bin | 10111001111010000001010… |
… | …101000010010111010011001 |
3 | 111101212112101010122122121121 |
4 | 113033100022220102322121 |
5 | 101343444143322023001 |
6 | 1001211302224005241 |
7 | 30345640033115122 |
oct | 2717201250227231 |
9 | 441775333578547 |
10 | 102203220111001 |
11 | 2a624162358219 |
12 | b567803760821 |
13 | 4504950b89ab9 |
14 | 1b3493b2c5049 |
15 | bc38187936a1 |
hex | 5cf40aa12e99 |
102203220111001 has 8 divisors (see below), whose sum is σ = 102228959416064. Its totient is φ = 102177483851520.
The previous prime is 102203220110989. The next prime is 102203220111023. The reversal of 102203220111001 is 100111022302201.
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 102203220111001 - 211 = 102203220108953 is a prime.
It is a super-2 number, since 2×1022032201110012 (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 (102203220111101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67122736 + ... + 68628478.
It is an arithmetic number, because the mean of its divisors is an integer number (12778619927008).
Almost surely, 2102203220111001 is an apocalyptic number.
It is an amenable number.
102203220111001 is a deficient number, since it is larger than the sum of its proper divisors (25739305063).
102203220111001 is a wasteful number, since it uses less digits than its factorization.
102203220111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1522791.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102203220111001 its reverse (100111022302201), we get a palindrome (202314242413202).
The spelling of 102203220111001 in words is "one hundred two trillion, two hundred three billion, two hundred twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.982 sec. • engine limits •