Base | Representation |
---|---|
bin | 10111000000111100101010… |
… | …001000101111100111111001 |
3 | 111021101120000212010221012020 |
4 | 113000330222020233213321 |
5 | 101231342433001400441 |
6 | 555135530221105053 |
7 | 30214626642205413 |
oct | 2700745210574771 |
9 | 437346025127166 |
10 | 101220201200121 |
11 | 2a285278854983 |
12 | b4291a06b8189 |
13 | 44630409c2bb3 |
14 | 1add1262379b3 |
15 | ba7e82c1ae66 |
hex | 5c0f2a22f9f9 |
101220201200121 has 8 divisors (see below), whose sum is σ = 136586295595680. Its totient is φ = 66667120468992.
The previous prime is 101220201200039. The next prime is 101220201200123. The reversal of 101220201200121 is 121002102022101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101220201200121 - 239 = 100670445386233 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101220201200121.
It is not an unprimeable number, because it can be changed into a prime (101220201200123) 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, 203253415816 + ... + 203253416313.
It is an arithmetic number, because the mean of its divisors is an integer number (17073286949460).
Almost surely, 2101220201200121 is an apocalyptic number.
It is an amenable number.
101220201200121 is a deficient number, since it is larger than the sum of its proper divisors (35366094395559).
101220201200121 is an equidigital number, since it uses as much as digits as its factorization.
101220201200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406506832215.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101220201200121 its reverse (121002102022101), we get a palindrome (222222303222222).
The spelling of 101220201200121 in words is "one hundred one trillion, two hundred twenty billion, two hundred one million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •