Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …110001111111001000001 |
3 | 11020201221212000122220210 |
4 | 101131302032033321001 |
5 | 124131013311311223 |
6 | 2315211521024333 |
7 | 152466243325521 |
oct | 21356216177101 |
9 | 4221855018823 |
10 | 1200212213313 |
11 | 4230095610a3 |
12 | 1747387850a9 |
13 | 8924455a109 |
14 | 4213a7a9681 |
15 | 21348658893 |
hex | 1177238fe41 |
1200212213313 has 4 divisors (see below), whose sum is σ = 1600282951088. Its totient is φ = 800141475540.
The previous prime is 1200212213287. The next prime is 1200212213357. The reversal of 1200212213313 is 3133122120021.
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 1200212213313 - 234 = 1183032344129 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1200212213313.
It is not an unprimeable number, because it can be changed into a prime (1200212213393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 200035368883 + ... + 200035368888.
It is an arithmetic number, because the mean of its divisors is an integer number (400070737772).
Almost surely, 21200212213313 is an apocalyptic number.
It is an amenable number.
1200212213313 is a deficient number, since it is larger than the sum of its proper divisors (400070737775).
1200212213313 is an equidigital number, since it uses as much as digits as its factorization.
1200212213313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400070737774.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1200212213313 its reverse (3133122120021), we get a palindrome (4333334333334).
The spelling of 1200212213313 in words is "one trillion, two hundred billion, two hundred twelve million, two hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •