Base | Representation |
---|---|
bin | 10111001100011101011011… |
… | …111110010100100010111001 |
3 | 111101012012000200101111221110 |
4 | 113030131123332110202321 |
5 | 101332323131143423113 |
6 | 1000543203252230533 |
7 | 30326034251202435 |
oct | 2714353376244271 |
9 | 441165020344843 |
10 | 102011311311033 |
11 | 2a55a8328953a3 |
12 | b53658590b449 |
13 | 44bc818c62c67 |
14 | 1b29533a4b9c5 |
15 | bbd835831bc3 |
hex | 5cc75bf948b9 |
102011311311033 has 16 divisors (see below), whose sum is σ = 136431923019776. Its totient is φ = 67799138069520.
The previous prime is 102011311311031. The next prime is 102011311311037. The reversal of 102011311311033 is 330113113110201.
It is not a de Polignac number, because 102011311311033 - 21 = 102011311311031 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102011311311031) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20787660 + ... + 25222002.
It is an arithmetic number, because the mean of its divisors is an integer number (8526995188736).
Almost surely, 2102011311311033 is an apocalyptic number.
It is an amenable number.
102011311311033 is a deficient number, since it is larger than the sum of its proper divisors (34420611708743).
102011311311033 is a wasteful number, since it uses less digits than its factorization.
102011311311033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4457844.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 102011311311033 its reverse (330113113110201), we get a palindrome (432124424421234).
The spelling of 102011311311033 in words is "one hundred two trillion, eleven billion, three hundred eleven million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •