Base | Representation |
---|---|
bin | 110000001110101000110010… |
… | …011100000100110111010101 |
3 | 1000211000201102000201010110222 |
4 | 300032220302130010313111 |
5 | 210300221040340213023 |
6 | 2031042542023124125 |
7 | 62451410413061441 |
oct | 6016506234046725 |
9 | 1024021360633428 |
10 | 212112101101013 |
11 | 61649267358583 |
12 | 1b9588b55a3645 |
13 | 91481155606a9 |
14 | 3a543cd87b821 |
15 | 197c7c878acc8 |
hex | c0ea32704dd5 |
212112101101013 has 16 divisors (see below), whose sum is σ = 218839405911360. Its totient is φ = 205490556374400.
The previous prime is 212112101101009. The next prime is 212112101101031. The reversal of 212112101101013 is 310101101211212.
It is a cyclic number.
It is not a de Polignac number, because 212112101101013 - 22 = 212112101101009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212112101100982 and 212112101101000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212112101101613) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23877833 + ... + 31533713.
It is an arithmetic number, because the mean of its divisors is an integer number (13677462869460).
Almost surely, 2212112101101013 is an apocalyptic number.
It is an amenable number.
212112101101013 is a deficient number, since it is larger than the sum of its proper divisors (6727304810347).
212112101101013 is an equidigital number, since it uses as much as digits as its factorization.
212112101101013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7662788.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 212112101101013 its reverse (310101101211212), we get a palindrome (522213202312225).
The spelling of 212112101101013 in words is "two hundred twelve trillion, one hundred twelve billion, one hundred one million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •