Base | Representation |
---|---|
bin | 1011101001100011001… |
… | …1100010000100000001 |
3 | 201010120112221011022010 |
4 | 2322120303202010001 |
5 | 11234332312010223 |
6 | 231534530203133 |
7 | 20313314063436 |
oct | 2723063420401 |
9 | 633515834263 |
10 | 200132141313 |
11 | 7796a4159a5 |
12 | 32953a234a9 |
13 | 15b458074c0 |
14 | 998787bb8d |
15 | 5314d77393 |
hex | 2e98ce2101 |
200132141313 has 8 divisors (see below), whose sum is σ = 287369228608. Its totient is φ = 123158240784.
The previous prime is 200132141311. The next prime is 200132141323. The reversal of 200132141313 is 313141231002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200132141313 - 21 = 200132141311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200132141313.
It is not an unprimeable number, because it can be changed into a prime (200132141311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2565796645 + ... + 2565796722.
It is an arithmetic number, because the mean of its divisors is an integer number (35921153576).
Almost surely, 2200132141313 is an apocalyptic number.
It is an amenable number.
200132141313 is a deficient number, since it is larger than the sum of its proper divisors (87237087295).
200132141313 is a wasteful number, since it uses less digits than its factorization.
200132141313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5131593383.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 200132141313 its reverse (313141231002), we get a palindrome (513273372315).
The spelling of 200132141313 in words is "two hundred billion, one hundred thirty-two million, one hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •