Base | Representation |
---|---|
bin | 1011101010001101101… |
… | …0001011000110000101 |
3 | 201011000221200111112222 |
4 | 2322203122023012011 |
5 | 11240213332334023 |
6 | 232004323222125 |
7 | 20320604162333 |
oct | 2724332130605 |
9 | 634027614488 |
10 | 200310043013 |
11 | 77a508850a3 |
12 | 329a3517945 |
13 | 15b73625292 |
14 | 99a334ab53 |
15 | 53257b8cc8 |
hex | 2ea368b185 |
200310043013 has 2 divisors, whose sum is σ = 200310043014. Its totient is φ = 200310043012.
The previous prime is 200310043009. The next prime is 200310043177. The reversal of 200310043013 is 310340013002.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 174257823364 + 26052219649 = 417442^2 + 161407^2 .
It is a cyclic number.
It is not a de Polignac number, because 200310043013 - 22 = 200310043009 is a prime.
It is a super-2 number, since 2×2003100430132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200310042982 and 200310043000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200310093013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100155021506 + 100155021507.
It is an arithmetic number, because the mean of its divisors is an integer number (100155021507).
Almost surely, 2200310043013 is an apocalyptic number.
It is an amenable number.
200310043013 is a deficient number, since it is larger than the sum of its proper divisors (1).
200310043013 is an equidigital number, since it uses as much as digits as its factorization.
200310043013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200310043013 its reverse (310340013002), we get a palindrome (510650056015).
The spelling of 200310043013 in words is "two hundred billion, three hundred ten million, forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •