Base | Representation |
---|---|
bin | 10111001111010110110011… |
… | …000000100010000111010111 |
3 | 111101220012202022222201002211 |
4 | 113033112303000202013113 |
5 | 101344103234020114221 |
6 | 1001214440524014251 |
7 | 30346311336162430 |
oct | 2717266300420727 |
9 | 441805668881084 |
10 | 102210340004311 |
11 | 2a627186350470 |
12 | b569070091387 |
13 | 4505516c80216 |
14 | 1b35014b30487 |
15 | bc3ad38916e1 |
hex | 5cf5b30221d7 |
102210340004311 has 8 divisors (see below), whose sum is σ = 127431073252224. Its totient is φ = 79644420782520.
The previous prime is 102210340004281. The next prime is 102210340004413. The reversal of 102210340004311 is 113400043012201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102210340004311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102210340004711) 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, 663703506445 + ... + 663703506598.
It is an arithmetic number, because the mean of its divisors is an integer number (15928884156528).
Almost surely, 2102210340004311 is an apocalyptic number.
102210340004311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102210340004311 is a deficient number, since it is larger than the sum of its proper divisors (25220733247913).
102210340004311 is a wasteful number, since it uses less digits than its factorization.
102210340004311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1327407013061.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 102210340004311 its reverse (113400043012201), we get a palindrome (215610383016512).
The spelling of 102210340004311 in words is "one hundred two trillion, two hundred ten billion, three hundred forty million, four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •