Base | Representation |
---|---|
bin | 11001000011110001000101… |
… | …000110010100111101111100 |
3 | 112110012222022210102101111211 |
4 | 121003301011012110331330 |
5 | 103421140110121231022 |
6 | 1030221441223254204 |
7 | 32133261016111135 |
oct | 3103610506247574 |
9 | 473188283371454 |
10 | 110210020102012 |
11 | 321308971a6336 |
12 | 1043b5348aa364 |
13 | 49659b64c877c |
14 | 1d3029cad8c8c |
15 | cb1c376b5e77 |
hex | 643c45194f7c |
110210020102012 has 12 divisors (see below), whose sum is σ = 192868256075320. Its totient is φ = 55104804080496.
The previous prime is 110210020102001. The next prime is 110210020102019. The reversal of 110210020102012 is 210201020012011.
It is a junction number, because it is equal to n+sod(n) for n = 110210020101983 and 110210020102001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110210020102019) 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, 50285562 + ... + 52431457.
Almost surely, 2110210020102012 is an apocalyptic number.
It is an amenable number.
110210020102012 is a deficient number, since it is larger than the sum of its proper divisors (82658235973308).
110210020102012 is a wasteful number, since it uses less digits than its factorization.
110210020102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102985260 (or 102985258 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110210020102012 its reverse (210201020012011), we get a palindrome (320411040114023).
Subtracting 110210020102012 from its reverse (210201020012011), we obtain a palindrome (99990999909999).
The spelling of 110210020102012 in words is "one hundred ten trillion, two hundred ten billion, twenty million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •