Base | Representation |
---|---|
bin | 101101110000001010100110… |
… | …011011010101011011100010 |
3 | 222101110122011212001001222121 |
4 | 231300022212123111123202 |
5 | 202333310134030013442 |
6 | 1551544040520454454 |
7 | 60245544664042165 |
oct | 5560124633253342 |
9 | 871418155031877 |
10 | 201222010001122 |
11 | 5912a858887010 |
12 | 1a69a21001a42a |
13 | 88382007baa96 |
14 | 37992a9373adc |
15 | 183e3a61d1967 |
hex | b702a66d56e2 |
201222010001122 has 32 divisors (see below), whose sum is σ = 336832176660480. Its totient is φ = 89371018537680.
The previous prime is 201222010001071. The next prime is 201222010001153. The reversal of 201222010001122 is 221100010222102.
It is a happy number.
201222010001122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201222010001096 and 201222010001105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 159673372 + ... + 160928647.
It is an arithmetic number, because the mean of its divisors is an integer number (10526005520640).
Almost surely, 2201222010001122 is an apocalyptic number.
201222010001122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201222010001122 is a deficient number, since it is larger than the sum of its proper divisors (135610166659358).
201222010001122 is a wasteful number, since it uses less digits than its factorization.
201222010001122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 320602686.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201222010001122 its reverse (221100010222102), we get a palindrome (422322020223224).
The spelling of 201222010001122 in words is "two hundred one trillion, two hundred twenty-two billion, ten million, one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •