Base | Representation |
---|---|
bin | 10001101000110111011… |
… | …100100001100111110101 |
3 | 11021212200002200202120211 |
4 | 101220313130201213311 |
5 | 124324400404031401 |
6 | 2324500333225421 |
7 | 153400145344036 |
oct | 21506734414765 |
9 | 4255602622524 |
10 | 1212111002101 |
11 | 42806507423a |
12 | 176ab9632271 |
13 | 8a3bc745a3c |
14 | 42948b9ca8d |
15 | 217e3085951 |
hex | 11a377219f5 |
1212111002101 has 8 divisors (see below), whose sum is σ = 1214786232504. Its totient is φ = 1209438690240.
The previous prime is 1212111002099. The next prime is 1212111002147. The reversal of 1212111002101 is 1012001112121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 56335497201 + 1155775504900 = 237351^2 + 1075070^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1212111002101 - 21 = 1212111002099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1212111003101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 102955 + ... + 1560391.
It is an arithmetic number, because the mean of its divisors is an integer number (151848279063).
Almost surely, 21212111002101 is an apocalyptic number.
It is an amenable number.
1212111002101 is a deficient number, since it is larger than the sum of its proper divisors (2675230403).
1212111002101 is a wasteful number, since it uses less digits than its factorization.
1212111002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1459271.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1212111002101 its reverse (1012001112121), we get a palindrome (2224112114222).
The spelling of 1212111002101 in words is "one trillion, two hundred twelve billion, one hundred eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •