Base | Representation |
---|---|
bin | 11101011101011001000… |
… | …10101110111110001001 |
3 | 10120202200210122102201010 |
4 | 32232230202232332021 |
5 | 113041002244213001 |
6 | 2053000454114133 |
7 | 133062362620023 |
oct | 16565442567611 |
9 | 3522623572633 |
10 | 1012212101001 |
11 | 360305385152 |
12 | 14420b94b949 |
13 | 745b33635ca |
14 | 36dc42b7013 |
15 | 1b4e39318d6 |
hex | ebac8aef89 |
1012212101001 has 4 divisors (see below), whose sum is σ = 1349616134672. Its totient is φ = 674808067332.
The previous prime is 1012212100969. The next prime is 1012212101027. The reversal of 1012212101001 is 1001012122101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 1012212101001 - 25 = 1012212100969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012212101041) 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, 168702016831 + ... + 168702016836.
It is an arithmetic number, because the mean of its divisors is an integer number (337404033668).
Almost surely, 21012212101001 is an apocalyptic number.
It is an amenable number.
1012212101001 is a deficient number, since it is larger than the sum of its proper divisors (337404033671).
1012212101001 is an equidigital number, since it uses as much as digits as its factorization.
1012212101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337404033670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1012212101001 its reverse (1001012122101), we get a palindrome (2013224223102).
The spelling of 1012212101001 in words is "one trillion, twelve billion, two hundred twelve million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •