Base | Representation |
---|---|
bin | 101101011110011010100000… |
… | …000010011100011110010011 |
3 | 222020011000110110120000022112 |
4 | 231132122200002130132103 |
5 | 202203313331304213021 |
6 | 1545211413331455535 |
7 | 60061451165010452 |
oct | 5536324002343623 |
9 | 866130413500275 |
10 | 200002132101011 |
11 | 587aa4785873a9 |
12 | 1a5219054575ab |
13 | 877a173c09106 |
14 | 3756224c68b99 |
15 | 181c7ab347d5b |
hex | b5e6a009c793 |
200002132101011 has 16 divisors (see below), whose sum is σ = 209241367636224. Its totient is φ = 190808269480224.
The previous prime is 200002132101001. The next prime is 200002132101131. The reversal of 200002132101011 is 110101231200002.
It is a cyclic number.
It is not a de Polignac number, because 200002132101011 - 230 = 200001058359187 is a prime.
It is a super-2 number, since 2×2000021321010112 (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 (200002132101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107066336 + ... + 108918338.
It is an arithmetic number, because the mean of its divisors is an integer number (13077585477264).
Almost surely, 2200002132101011 is an apocalyptic number.
200002132101011 is a deficient number, since it is larger than the sum of its proper divisors (9239235535213).
200002132101011 is a wasteful number, since it uses less digits than its factorization.
200002132101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1864250.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 200002132101011 its reverse (110101231200002), we get a palindrome (310103363301013).
The spelling of 200002132101011 in words is "two hundred trillion, two billion, one hundred thirty-two million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.610 sec. • engine limits •