Base | Representation |
---|---|
bin | 101101011110110100100011… |
… | …001011001011110111001111 |
3 | 222020020200122201212200012102 |
4 | 231132310203023023313033 |
5 | 202204243122103330333 |
6 | 1545232321004025315 |
7 | 60063461254223522 |
oct | 5536644313136717 |
9 | 866220581780172 |
10 | 200030102011343 |
11 | 588103208a1a7a |
12 | 1a52721053223b |
13 | 877c9b0820106 |
14 | 3757719824bb9 |
15 | 181d396b18ae8 |
hex | b5ed232cbdcf |
200030102011343 has 4 divisors (see below), whose sum is σ = 200030334815040. Its totient is φ = 200029869207648.
The previous prime is 200030102011301. The next prime is 200030102011357. The reversal of 200030102011343 is 343110201030002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200030102011343 - 28 = 200030102011087 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 (200030102071343) 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 3 ways as a sum of consecutive naturals, for example, 115108223 + ... + 116833056.
It is an arithmetic number, because the mean of its divisors is an integer number (50007583703760).
Almost surely, 2200030102011343 is an apocalyptic number.
200030102011343 is a deficient number, since it is larger than the sum of its proper divisors (232803697).
200030102011343 is an equidigital number, since it uses as much as digits as its factorization.
200030102011343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232803696.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 200030102011343 its reverse (343110201030002), we get a palindrome (543140303041345).
The spelling of 200030102011343 in words is "two hundred trillion, thirty billion, one hundred two million, eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •