Base | Representation |
---|---|
bin | 10001011101100110110… |
… | …100110111101100001101 |
3 | 11020201110112020120221112 |
4 | 101131212310313230031 |
5 | 124130120334324323 |
6 | 2315140530541405 |
7 | 152461432203143 |
oct | 21354664675415 |
9 | 4221415216845 |
10 | 1200021011213 |
11 | 422a20638132 |
12 | 1746a4737865 |
13 | 89213a6348b |
14 | 4211d237593 |
15 | 2133698b178 |
hex | 11766d37b0d |
1200021011213 has 4 divisors (see below), whose sum is σ = 1200055641600. Its totient is φ = 1199986380828.
The previous prime is 1200021011209. The next prime is 1200021011219. The reversal of 1200021011213 is 3121101200021.
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 a cyclic number.
It is not a de Polignac number, because 1200021011213 - 22 = 1200021011209 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 (1200021011219) 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, 17263163 + ... + 17332536.
It is an arithmetic number, because the mean of its divisors is an integer number (300013910400).
Almost surely, 21200021011213 is an apocalyptic number.
It is an amenable number.
1200021011213 is a deficient number, since it is larger than the sum of its proper divisors (34630387).
1200021011213 is an equidigital number, since it uses as much as digits as its factorization.
1200021011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34630386.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1200021011213 its reverse (3121101200021), we get a palindrome (4321122211234).
The spelling of 1200021011213 in words is "one trillion, two hundred billion, twenty-one million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •