Base | Representation |
---|---|
bin | 101101011111110110101011… |
… | …101101100011111100110011 |
3 | 222020111110221120002001210011 |
4 | 231133312223231203330303 |
5 | 202211424034210413021 |
6 | 1545325103142515351 |
7 | 60101554045663540 |
oct | 5537665355437463 |
9 | 866443846061704 |
10 | 200101112201011 |
11 | 5883845023753a |
12 | 1a538b29735b57 |
13 | 87865b9331918 |
14 | 375ad3467bbc7 |
15 | 1820150c6ede1 |
hex | b5fdabb63f33 |
200101112201011 has 96 divisors (see below), whose sum is σ = 251971204106880. Its totient is φ = 155448579686400.
The previous prime is 200101112200973. The next prime is 200101112201063. The reversal of 200101112201011 is 110102211101002.
It is a happy number.
It is not a de Polignac number, because 200101112201011 - 213 = 200101112192819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200101112200982 and 200101112201000.
It is not an unprimeable number, because it can be changed into a prime (200101112201411) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 42385321131 + ... + 42385325851.
It is an arithmetic number, because the mean of its divisors is an integer number (2624700042780).
Almost surely, 2200101112201011 is an apocalyptic number.
200101112201011 is a deficient number, since it is larger than the sum of its proper divisors (51870091905869).
200101112201011 is a wasteful number, since it uses less digits than its factorization.
200101112201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6545 (or 6528 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200101112201011 its reverse (110102211101002), we get a palindrome (310203323302013).
The spelling of 200101112201011 in words is "two hundred trillion, one hundred one billion, one hundred twelve million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •