Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …111010001000101100100010 |
3 | 222100201120121222200002022001 |
4 | 231231013030322020230202 |
5 | 202321340442231242010 |
6 | 1551303421511434214 |
7 | 60224436521210161 |
oct | 5555071472105442 |
9 | 870646558602261 |
10 | 201012202212130 |
11 | 59059883853881 |
12 | 1a66561798596a |
13 | 88214a556c38a |
14 | 378d0848853d8 |
15 | 1838bc6bbac3a |
hex | b6d1cce88b22 |
201012202212130 has 8 divisors (see below), whose sum is σ = 361821963981852. Its totient is φ = 80404880884848.
The previous prime is 201012202212083. The next prime is 201012202212131. The reversal of 201012202212130 is 31212202210102.
It can be written as a sum of positive squares in 2 ways, for example, as 198828584234281 + 2183617977849 = 14100659^2 + 1477707^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 201012202212098 and 201012202212107.
It is not an unprimeable number, because it can be changed into a prime (201012202212131) 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 3 ways as a sum of consecutive naturals, for example, 10050610110597 + ... + 10050610110616.
Almost surely, 2201012202212130 is an apocalyptic number.
201012202212130 is a deficient number, since it is larger than the sum of its proper divisors (160809761769722).
201012202212130 is a wasteful number, since it uses less digits than its factorization.
201012202212130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20101220221220.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 201012202212130 its reverse (31212202210102), we get a palindrome (232224404422232).
The spelling of 201012202212130 in words is "two hundred one trillion, twelve billion, two hundred two million, two hundred twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •