Base | Representation |
---|---|
bin | 10111001100011101001010… |
… | …000100101111001011111101 |
3 | 111101012011020202022021221122 |
4 | 113030131022010233023331 |
5 | 101332322022304100013 |
6 | 1000543113403440325 |
7 | 30326023643501261 |
oct | 2714351204571375 |
9 | 441164222267848 |
10 | 102011011003133 |
11 | 2a55a699320651 |
12 | b5365012260a5 |
13 | 44bc79b987c8b |
14 | 1b29505bd80a1 |
15 | bbd8192b1a08 |
hex | 5cc74a12f2fd |
102011011003133 has 4 divisors (see below), whose sum is σ = 102011350965408. Its totient is φ = 102010671040860.
The previous prime is 102011011003091. The next prime is 102011011003151. The reversal of 102011011003133 is 331300110110201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102011011003133 - 228 = 102010742567677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011011003183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 169530641 + ... + 170131302.
It is an arithmetic number, because the mean of its divisors is an integer number (25502837741352).
Almost surely, 2102011011003133 is an apocalyptic number.
It is an amenable number.
102011011003133 is a deficient number, since it is larger than the sum of its proper divisors (339962275).
102011011003133 is an equidigital number, since it uses as much as digits as its factorization.
102011011003133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 339962274.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 102011011003133 its reverse (331300110110201), we get a palindrome (433311121113334).
The spelling of 102011011003133 in words is "one hundred two trillion, eleven billion, eleven million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •