Base | Representation |
---|---|
bin | 101101011110100010110000… |
… | …100111100110011000111001 |
3 | 222020011212100111110200020200 |
4 | 231132202300213212120321 |
5 | 202203440012023223001 |
6 | 1545215441322112413 |
7 | 60062214016466520 |
oct | 5536426047463071 |
9 | 866155314420220 |
10 | 200011000211001 |
11 | 58803209385721 |
12 | 1a52357b34b709 |
13 | 877ac5825b585 |
14 | 375682694b4b7 |
15 | 181cb29b71086 |
hex | b5e8b09e6639 |
200011000211001 has 24 divisors (see below), whose sum is σ = 330378585735744. Its totient is φ = 114222182101920.
The previous prime is 200011000210981. The next prime is 200011000211023. The reversal of 200011000211001 is 100112000110002.
It is a happy number.
It is not a de Polignac number, because 200011000211001 - 211 = 200011000208953 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (200011000231001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 969590755 + ... + 969797016.
It is an arithmetic number, because the mean of its divisors is an integer number (13765774405656).
Almost surely, 2200011000211001 is an apocalyptic number.
200011000211001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200011000211001 is a deficient number, since it is larger than the sum of its proper divisors (130367585524743).
200011000211001 is a wasteful number, since it uses less digits than its factorization.
200011000211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1939389421 (or 1939389418 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 200011000211001 its reverse (100112000110002), we get a palindrome (300123000321003).
The spelling of 200011000211001 in words is "two hundred trillion, eleven billion, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •