Base | Representation |
---|---|
bin | 101101101111110111000010… |
… | …110010111001000110101010 |
3 | 222101101121222101220110220121 |
4 | 231233313002302321012222 |
5 | 202332434132320231442 |
6 | 1551530245105313454 |
7 | 60244202422251253 |
oct | 5557670262710652 |
9 | 871347871813817 |
10 | 201201011102122 |
11 | 59121962516429 |
12 | 1a69612b63588a |
13 | 88362351a0165 |
14 | 3798276549b2a |
15 | 183da77900967 |
hex | b6fdc2cb91aa |
201201011102122 has 8 divisors (see below), whose sum is σ = 301801775335236. Its totient is φ = 100600419323712.
The previous prime is 201201011102107. The next prime is 201201011102123. The reversal of 201201011102122 is 221201110102102.
It can be written as a sum of positive squares in 2 ways, for example, as 194648286592881 + 6552724509241 = 13951641^2 + 2559829^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2012010111021222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201201011102096 and 201201011102105.
It is not an unprimeable number, because it can be changed into a prime (201201011102123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40156383 + ... + 44888050.
Almost surely, 2201201011102122 is an apocalyptic number.
201201011102122 is a deficient number, since it is larger than the sum of its proper divisors (100600764233114).
201201011102122 is a wasteful number, since it uses less digits than its factorization.
201201011102122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86227352.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201201011102122 its reverse (221201110102102), we get a palindrome (422402121204224).
The spelling of 201201011102122 in words is "two hundred one trillion, two hundred one billion, eleven million, one hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •