Base | Representation |
---|---|
bin | 101101011110011001101111… |
… | …000010011010111110100101 |
3 | 222020010221100011122112020111 |
4 | 231132121233002122332211 |
5 | 202203310140330330201 |
6 | 1545211200003333021 |
7 | 60061421623242451 |
oct | 5536315702327645 |
9 | 866127304575214 |
10 | 200001310011301 |
11 | 587aa096529217 |
12 | 1a521716081171 |
13 | 877a0727c08b6 |
14 | 37561879cd661 |
15 | 181c75e0aab51 |
hex | b5e66f09afa5 |
200001310011301 has 4 divisors (see below), whose sum is σ = 200083852857312. Its totient is φ = 199918767165292.
The previous prime is 200001310011281. The next prime is 200001310011323. The reversal of 200001310011301 is 103110013100002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 200001310011301 - 213 = 200001310003109 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 (200001310014301) 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, 41271419371 + ... + 41271424216.
It is an arithmetic number, because the mean of its divisors is an integer number (50020963214328).
Almost surely, 2200001310011301 is an apocalyptic number.
It is an amenable number.
200001310011301 is a deficient number, since it is larger than the sum of its proper divisors (82542846011).
200001310011301 is an equidigital number, since it uses as much as digits as its factorization.
200001310011301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82542846010.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 200001310011301 its reverse (103110013100002), we get a palindrome (303111323111303).
The spelling of 200001310011301 in words is "two hundred trillion, one billion, three hundred ten million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •