Base | Representation |
---|---|
bin | 10111001111001110001101… |
… | …011101011011110110001011 |
3 | 111101212022221210010122120020 |
4 | 113033032031131123312023 |
5 | 101343430343222041021 |
6 | 1001210314005431523 |
7 | 30345534013324104 |
oct | 2717161535336613 |
9 | 441768853118506 |
10 | 102201120112011 |
11 | 2a623284a1a968 |
12 | b56731840b5a3 |
13 | 45046a7a9c54b |
14 | 1b347bc4393ab |
15 | bc374422b7c6 |
hex | 5cf38d75bd8b |
102201120112011 has 8 divisors (see below), whose sum is σ = 137993073569280. Its totient is φ = 67271623364712.
The previous prime is 102201120111997. The next prime is 102201120112027. The reversal of 102201120112011 is 110211021102201.
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 102201120112011 - 246 = 31832375934347 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102201120112031) 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, 215614177215 + ... + 215614177688.
It is an arithmetic number, because the mean of its divisors is an integer number (17249134196160).
Almost surely, 2102201120112011 is an apocalyptic number.
102201120112011 is a deficient number, since it is larger than the sum of its proper divisors (35791953457269).
102201120112011 is an equidigital number, since it uses as much as digits as its factorization.
102201120112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431228354985.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102201120112011 its reverse (110211021102201), we get a palindrome (212412141214212).
The spelling of 102201120112011 in words is "one hundred two trillion, two hundred one billion, one hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.914 sec. • engine limits •