Base | Representation |
---|---|
bin | 10111001100010011000110… |
… | …010110011101001101111111 |
3 | 111101011010101002102102211221 |
4 | 113030103012112131031333 |
5 | 101332132413021333043 |
6 | 1000534130004454211 |
7 | 30325162214143435 |
oct | 2714230626351577 |
9 | 441133332372757 |
10 | 102000211121023 |
11 | 2a556057046346 |
12 | b5343a83aa367 |
13 | 44bb76a3594a7 |
14 | 1b28b9d73ad55 |
15 | bbd3d60a18ed |
hex | 5cc4c659d37f |
102000211121023 has 8 divisors (see below), whose sum is σ = 102225215004800. Its totient is φ = 101775270999960.
The previous prime is 102000211120967. The next prime is 102000211121057. The reversal of 102000211121023 is 320121112000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102000211121023 - 237 = 101862772167551 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102000211120988 and 102000211121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102000211181023) 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, 12737073 + ... + 19137226.
It is an arithmetic number, because the mean of its divisors is an integer number (12778151875600).
Almost surely, 2102000211121023 is an apocalyptic number.
102000211121023 is a deficient number, since it is larger than the sum of its proper divisors (225003883777).
102000211121023 is an equidigital number, since it uses as much as digits as its factorization.
102000211121023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31881357.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102000211121023 its reverse (320121112000201), we get a palindrome (422121323121224).
The spelling of 102000211121023 in words is "one hundred two trillion, two hundred eleven million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •