Base | Representation |
---|---|
bin | 10111001100010100110010… |
… | …010010011101000011011111 |
3 | 111101011022001021221012000220 |
4 | 113030110302102131003133 |
5 | 101332200120113323403 |
6 | 1000535025414252423 |
7 | 30325255123355364 |
oct | 2714246222350337 |
9 | 441138037835026 |
10 | 102002022011103 |
11 | 2a5568a6268915 |
12 | b534812957113 |
13 | 44bb998590296 |
14 | 1b28cd204a46b |
15 | bbd49005b953 |
hex | 5cc53249d0df |
102002022011103 has 8 divisors (see below), whose sum is σ = 136381533609600. Its totient is φ = 67811929210008.
The previous prime is 102002022011101. The next prime is 102002022011117. The reversal of 102002022011103 is 301110220200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102002022011103 - 21 = 102002022011101 is a prime.
It is a super-3 number, since 3×1020020220111033 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002022011101) 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, 47354698093 + ... + 47354700246.
It is an arithmetic number, because the mean of its divisors is an integer number (17047691701200).
Almost surely, 2102002022011103 is an apocalyptic number.
102002022011103 is a deficient number, since it is larger than the sum of its proper divisors (34379511598497).
102002022011103 is an equidigital number, since it uses as much as digits as its factorization.
102002022011103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94709398701.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102002022011103 its reverse (301110220200201), we get a palindrome (403112242211304).
The spelling of 102002022011103 in words is "one hundred two trillion, two billion, twenty-two million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •