Base | Representation |
---|---|
bin | 101101100010111100001101… |
… | …110010010110111101110111 |
3 | 222021020202102002102121012221 |
4 | 231202330031302112331313 |
5 | 202223412424010220343 |
6 | 1550010341352423211 |
7 | 60123103051142644 |
oct | 5542741562267567 |
9 | 867222362377187 |
10 | 200313211023223 |
11 | 5890a3a0516961 |
12 | 1a5720610a7b07 |
13 | 87a05bb105c9c |
14 | 37672d5542dcb |
15 | 18259164855ed |
hex | b62f0dc96f77 |
200313211023223 has 32 divisors (see below), whose sum is σ = 206128443755520. Its totient is φ = 194603169841920.
The previous prime is 200313211023181. The next prime is 200313211023241. The reversal of 200313211023223 is 322320112313002.
It is a cyclic number.
It is not a de Polignac number, because 200313211023223 - 245 = 165128838934391 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 (200313211033223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1491168486 + ... + 1491302812.
It is an arithmetic number, because the mean of its divisors is an integer number (6441513867360).
Almost surely, 2200313211023223 is an apocalyptic number.
200313211023223 is a deficient number, since it is larger than the sum of its proper divisors (5815232732297).
200313211023223 is a wasteful number, since it uses less digits than its factorization.
200313211023223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135567.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 200313211023223 its reverse (322320112313002), we get a palindrome (522633323336225).
The spelling of 200313211023223 in words is "two hundred trillion, three hundred thirteen billion, two hundred eleven million, twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •