Base | Representation |
---|---|
bin | 101101011110100100101101… |
… | …111101111010101101011011 |
3 | 222020012001210001122021012112 |
4 | 231132210231331322231123 |
5 | 202204003313410312103 |
6 | 1545220430124502535 |
7 | 60062320103640044 |
oct | 5536445575725533 |
9 | 866161701567175 |
10 | 200013103213403 |
11 | 58804098484537 |
12 | 1a523a676aaa4b |
13 | 877b201b5abac |
14 | 3756985d798cb |
15 | 181cbee5cccd8 |
hex | b5e92df7ab5b |
200013103213403 has 4 divisors (see below), whose sum is σ = 200016439215840. Its totient is φ = 200009767210968.
The previous prime is 200013103213379. The next prime is 200013103213411. The reversal of 200013103213403 is 304312301310002.
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 200013103213403 - 210 = 200013103212379 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200013103213423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1667911283 + ... + 1668031196.
It is an arithmetic number, because the mean of its divisors is an integer number (50004109803960).
Almost surely, 2200013103213403 is an apocalyptic number.
200013103213403 is a deficient number, since it is larger than the sum of its proper divisors (3336002437).
200013103213403 is an equidigital number, since it uses as much as digits as its factorization.
200013103213403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3336002436.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 200013103213403 its reverse (304312301310002), we get a palindrome (504325404523405).
The spelling of 200013103213403 in words is "two hundred trillion, thirteen billion, one hundred three million, two hundred thirteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •