Base | Representation |
---|---|
bin | 10111001111100000101111… |
… | …101101100010000100111011 |
3 | 111101221020022210020220100021 |
4 | 113033200233231202010323 |
5 | 101344242123130010021 |
6 | 1001223404514351311 |
7 | 30350140135446640 |
oct | 2717405755420473 |
9 | 441836283226307 |
10 | 102221022110011 |
11 | 2a6307680a25a2 |
12 | b56b15158b537 |
13 | 450652a082c1c |
14 | 1b357496cddc7 |
15 | bc400b589c41 |
hex | 5cf82fb6213b |
102221022110011 has 8 divisors (see below), whose sum is σ = 116824323416544. Its totient is φ = 87617795340480.
The previous prime is 102221022109949. The next prime is 102221022110017. The reversal of 102221022110011 is 110011220122201.
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 102221022110011 - 215 = 102221022077243 is a prime.
It is a super-2 number, since 2×1022210221100112 (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 (102221022110017) 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, 15663940 + ... + 21208513.
It is an arithmetic number, because the mean of its divisors is an integer number (14603040427068).
Almost surely, 2102221022110011 is an apocalyptic number.
102221022110011 is a deficient number, since it is larger than the sum of its proper divisors (14603301306533).
102221022110011 is an equidigital number, since it uses as much as digits as its factorization.
102221022110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37268501.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102221022110011 its reverse (110011220122201), we get a palindrome (212232242232212).
The spelling of 102221022110011 in words is "one hundred two trillion, two hundred twenty-one billion, twenty-two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •