Base | Representation |
---|---|
bin | 1001000110001000110111… |
… | …10111000101011001011101 |
3 | 2121211011222211122221011111 |
4 | 10203010123313011121131 |
5 | 10110203330302403313 |
6 | 110312503550022021 |
7 | 4133051300534032 |
oct | 443043367053135 |
9 | 77734884587144 |
10 | 20002130122333 |
11 | 6411945aaa517 |
12 | 22b0668aa7911 |
13 | b212676ba458 |
14 | 4d2173109389 |
15 | 24a47bd9d43d |
hex | 12311bdc565d |
20002130122333 has 8 divisors (see below), whose sum is σ = 21203968847040. Its totient is φ = 18803096157120.
The previous prime is 20002130122307. The next prime is 20002130122417. The reversal of 20002130122333 is 33322103120002.
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 20002130122333 - 25 = 20002130122301 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002130126333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 701175183 + ... + 701203708.
It is an arithmetic number, because the mean of its divisors is an integer number (2650496105880).
Almost surely, 220002130122333 is an apocalyptic number.
It is an amenable number.
20002130122333 is a deficient number, since it is larger than the sum of its proper divisors (1201838724707).
20002130122333 is a wasteful number, since it uses less digits than its factorization.
20002130122333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1402379747.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20002130122333 its reverse (33322103120002), we get a palindrome (53324233242335).
The spelling of 20002130122333 in words is "twenty trillion, two billion, one hundred thirty million, one hundred twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •