Base | Representation |
---|---|
bin | 10110110000111101111000… |
… | …111010011011100011101001 |
3 | 111010111120102002221201020020 |
4 | 112300331320322123203221 |
5 | 101110344334333021301 |
6 | 552535230022351053 |
7 | 30042401526330345 |
oct | 2660757072334351 |
9 | 433446362851206 |
10 | 100122011220201 |
11 | 299a1563181853 |
12 | b290396b8b489 |
13 | 43b3607c05729 |
14 | 1aa1d072d4625 |
15 | b8960b102436 |
hex | 5b0f78e9b8e9 |
100122011220201 has 8 divisors (see below), whose sum is σ = 133551801018720. Its totient is φ = 66720114450912.
The previous prime is 100122011220181. The next prime is 100122011220229. The reversal of 100122011220201 is 102022110221001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100122011220201 - 29 = 100122011219689 is a prime.
It is a super-3 number, since 3×1001220112202013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (100122011220901) 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, 6973248931 + ... + 6973263288.
It is an arithmetic number, because the mean of its divisors is an integer number (16693975127340).
Almost surely, 2100122011220201 is an apocalyptic number.
It is an amenable number.
100122011220201 is a deficient number, since it is larger than the sum of its proper divisors (33429789798519).
100122011220201 is a wasteful number, since it uses less digits than its factorization.
100122011220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13946514615.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100122011220201 its reverse (102022110221001), we get a palindrome (202144121441202).
The spelling of 100122011220201 in words is "one hundred trillion, one hundred twenty-two billion, eleven million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •