Base | Representation |
---|---|
bin | 101101100010111100001000… |
… | …100011110001000110001011 |
3 | 222021020202011222101102001112 |
4 | 231202330020203301012023 |
5 | 202223412234031441021 |
6 | 1550010324540440535 |
7 | 60123100634462063 |
oct | 5542741043610613 |
9 | 867222158342045 |
10 | 200313123312011 |
11 | 5890a355a59156 |
12 | 1a57203784914b |
13 | 87a05a5ba5a68 |
14 | 37672c7a303a3 |
15 | 182590d90bd5b |
hex | b62f088f118b |
200313123312011 has 8 divisors (see below), whose sum is σ = 209023025533344. Its totient is φ = 191603274089920.
The previous prime is 200313123311971. The next prime is 200313123312047. The reversal of 200313123312011 is 110213321313002.
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 200313123312011 - 210 = 200313123310987 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200313123312091) 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, 5428130 + ... + 20738631.
It is an arithmetic number, because the mean of its divisors is an integer number (26127878191668).
Almost surely, 2200313123312011 is an apocalyptic number.
200313123312011 is a deficient number, since it is larger than the sum of its proper divisors (8709902221333).
200313123312011 is a wasteful number, since it uses less digits than its factorization.
200313123312011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26499621.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 200313123312011 its reverse (110213321313002), we get a palindrome (310526444625013).
The spelling of 200313123312011 in words is "two hundred trillion, three hundred thirteen billion, one hundred twenty-three million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •