Base | Representation |
---|---|
bin | 101101011110011011011011… |
… | …101001001101101111000011 |
3 | 222020011010001011021020110222 |
4 | 231132123123221031233003 |
5 | 202203322403310320003 |
6 | 1545212100453413255 |
7 | 60061515030020642 |
oct | 5536333351155703 |
9 | 866133034236428 |
10 | 200003132120003 |
11 | 587aa941013483 |
12 | 1a521b4433a22b |
13 | 877a2a3151b24 |
14 | 37562bb9bd359 |
15 | 181c81902ec38 |
hex | b5e6dba4dbc3 |
200003132120003 has 16 divisors (see below), whose sum is σ = 202405586354400. Its totient is φ = 197611178204160.
The previous prime is 200003132119993. The next prime is 200003132120021. The reversal of 200003132120003 is 300021231300002.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200003132120003 is a prime.
It is a super-2 number, since 2×2000031321200032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200003132120303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 240055475 + ... + 240887187.
It is an arithmetic number, because the mean of its divisors is an integer number (12650349147150).
Almost surely, 2200003132120003 is an apocalyptic number.
200003132120003 is a deficient number, since it is larger than the sum of its proper divisors (2402454234397).
200003132120003 is a wasteful number, since it uses less digits than its factorization.
200003132120003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838022.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200003132120003 its reverse (300021231300002), we get a palindrome (500024363420005).
The spelling of 200003132120003 in words is "two hundred trillion, three billion, one hundred thirty-two million, one hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •