Base | Representation |
---|---|
bin | 101111110010110101000001… |
… | …111101111111001001011100 |
3 | 1000120021000210011020212001220 |
4 | 233302311001331333021130 |
5 | 210022413323401431022 |
6 | 2023021015223133340 |
7 | 62163346145666454 |
oct | 5762650175771134 |
9 | 1016230704225056 |
10 | 210201101202012 |
11 | 60a81871773978 |
12 | 1b6aa46b5a4250 |
13 | 9039b5691839b |
14 | 39c9b051a6d64 |
15 | 1947c2de7885c |
hex | bf2d41f7f25c |
210201101202012 has 48 divisors (see below), whose sum is σ = 495307070294400. Its totient is φ = 69376586552512.
The previous prime is 210201101201981. The next prime is 210201101202107. The reversal of 210201101202012 is 210202101102012.
It is a junction number, because it is equal to n+sod(n) for n = 210201101201982 and 210201101202000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39495438 + ... + 44500469.
It is an arithmetic number, because the mean of its divisors is an integer number (10318897297800).
Almost surely, 2210201101202012 is an apocalyptic number.
It is an amenable number.
210201101202012 is an abundant number, since it is smaller than the sum of its proper divisors (285105969092388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201101202012 is a wasteful number, since it uses less digits than its factorization.
210201101202012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83997970 (or 83997968 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 210201101202012 its reverse (210202101102012), we get a palindrome (420403202304024).
The spelling of 210201101202012 in words is "two hundred ten trillion, two hundred one billion, one hundred one million, two hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •