Base | Representation |
---|---|
bin | 10110111111011111010101… |
… | …110011100000101111101001 |
3 | 111021000222101210212021012102 |
4 | 112333133111303200233221 |
5 | 101223222231014201301 |
6 | 555021515422423145 |
7 | 30204451630001600 |
oct | 2677372563405751 |
9 | 437028353767172 |
10 | 101120002100201 |
11 | 2a24682aaa1097 |
12 | b411898131ab5 |
13 | 4456762b82a66 |
14 | 1ad833c98aa37 |
15 | ba556b2a3b6b |
hex | 5bf7d5ce0be9 |
101120002100201 has 12 divisors (see below), whose sum is σ = 117984766018320. Its totient is φ = 86412431647080.
The previous prime is 101120002100153. The next prime is 101120002100213. The reversal of 101120002100201 is 102001200021101.
It is not a de Polignac number, because 101120002100201 - 214 = 101120002083817 is a prime.
It is a super-3 number, since 3×1011200021002013 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101120002100701) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3117315371 + ... + 3117347808.
It is an arithmetic number, because the mean of its divisors is an integer number (9832063834860).
Almost surely, 2101120002100201 is an apocalyptic number.
It is an amenable number.
101120002100201 is a deficient number, since it is larger than the sum of its proper divisors (16864763918119).
101120002100201 is an equidigital number, since it uses as much as digits as its factorization.
101120002100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6234663524 (or 6234663517 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101120002100201 its reverse (102001200021101), we get a palindrome (203121202121302).
The spelling of 101120002100201 in words is "one hundred one trillion, one hundred twenty billion, two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •