Base | Representation |
---|---|
bin | 101101011110110100101001… |
… | …001101100111010001101101 |
3 | 222020020200220210111020111110 |
4 | 231132310221031213101231 |
5 | 202204243324021424323 |
6 | 1545232335023142233 |
7 | 60063463624241442 |
oct | 5536645115472155 |
9 | 866220823436443 |
10 | 200030203311213 |
11 | 58810372aa1080 |
12 | 1a52723a444979 |
13 | 877c9c87ca472 |
14 | 37577290739c9 |
15 | 181d3a0978793 |
hex | b5ed2936746d |
200030203311213 has 32 divisors (see below), whose sum is σ = 297170383011840. Its totient is φ = 118640326074560.
The previous prime is 200030203311209. The next prime is 200030203311233. The reversal of 200030203311213 is 312113302030002.
It is a cyclic number.
It is not a de Polignac number, because 200030203311213 - 22 = 200030203311209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200030203311213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200030203311233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11342356 + ... + 22993682.
It is an arithmetic number, because the mean of its divisors is an integer number (9286574469120).
Almost surely, 2200030203311213 is an apocalyptic number.
It is an amenable number.
200030203311213 is a deficient number, since it is larger than the sum of its proper divisors (97140179700627).
200030203311213 is a wasteful number, since it uses less digits than its factorization.
200030203311213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11662457.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 200030203311213 its reverse (312113302030002), we get a palindrome (512143505341215).
The spelling of 200030203311213 in words is "two hundred trillion, thirty billion, two hundred three million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •