Base | Representation |
---|---|
bin | 1011101001000011111… |
… | …1110000111101001001 |
3 | 201010020102102002222212 |
4 | 2322100333300331021 |
5 | 11234100242132223 |
6 | 231513530154505 |
7 | 20310133362245 |
oct | 2722077607511 |
9 | 633212362885 |
10 | 200001130313 |
11 | 77902473446 |
12 | 32917b82a35 |
13 | 15b246267ba |
14 | 99742d7425 |
15 | 53085e9278 |
hex | 2e90ff0f49 |
200001130313 has 4 divisors (see below), whose sum is σ = 200004775620. Its totient is φ = 199997485008.
The previous prime is 200001130289. The next prime is 200001130327. The reversal of 200001130313 is 313031100002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 313031100002 = 2 ⋅156515550001.
It can be written as a sum of positive squares in 2 ways, for example, as 147865628089 + 52135502224 = 384533^2 + 228332^2 .
It is a cyclic number.
It is not a de Polignac number, because 200001130313 - 28 = 200001130057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (200001130363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1739078 + ... + 1850511.
It is an arithmetic number, because the mean of its divisors is an integer number (50001193905).
Almost surely, 2200001130313 is an apocalyptic number.
It is an amenable number.
200001130313 is a deficient number, since it is larger than the sum of its proper divisors (3645307).
200001130313 is an equidigital number, since it uses as much as digits as its factorization.
200001130313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3645306.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 200001130313 its reverse (313031100002), we get a palindrome (513032230315).
The spelling of 200001130313 in words is "two hundred billion, one million, one hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •