Base | Representation |
---|---|
bin | 101111110010110100001100… |
… | …010000010000010011111011 |
3 | 1000120020221110100112010110101 |
4 | 233302310030100100103323 |
5 | 210022410002201134433 |
6 | 2023020345551500231 |
7 | 62163314624042335 |
oct | 5762641420202373 |
9 | 1016227410463411 |
10 | 210200200021243 |
11 | 60a8144a005483 |
12 | 1b6aa259827677 |
13 | 9039a41cca423 |
14 | 39c9a5b620455 |
15 | 1947bc9cb707d |
hex | bf2d0c4104fb |
210200200021243 has 2 divisors, whose sum is σ = 210200200021244. Its totient is φ = 210200200021242.
The previous prime is 210200200021193. The next prime is 210200200021261. The reversal of 210200200021243 is 342120002002012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210200200021243 - 29 = 210200200020731 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210200200021243.
It is not a weakly prime, because it can be changed into another prime (210200200051243) 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 as a sum of consecutive naturals, namely, 105100100010621 + 105100100010622.
It is an arithmetic number, because the mean of its divisors is an integer number (105100100010622).
Almost surely, 2210200200021243 is an apocalyptic number.
210200200021243 is a deficient number, since it is larger than the sum of its proper divisors (1).
210200200021243 is an equidigital number, since it uses as much as digits as its factorization.
210200200021243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 210200200021243 its reverse (342120002002012), we get a palindrome (552320202023255).
The spelling of 210200200021243 in words is "two hundred ten trillion, two hundred billion, two hundred million, twenty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •