Base | Representation |
---|---|
bin | 10110111101111010000001… |
… | …011010010000101010110011 |
3 | 111020122120121001010012002021 |
4 | 112331322001122100222303 |
5 | 101214431430233342321 |
6 | 554455524333332311 |
7 | 30163550666341444 |
oct | 2675720132205263 |
9 | 436576531105067 |
10 | 101011212012211 |
11 | 2a204683907866 |
12 | b3b4796637097 |
13 | 444941623ab27 |
14 | 1ad2d7c3572cb |
15 | ba2800503941 |
hex | 5bde81690ab3 |
101011212012211 has 8 divisors (see below), whose sum is σ = 102535983201744. Its totient is φ = 99486944974560.
The previous prime is 101011212012203. The next prime is 101011212012241. The reversal of 101011212012211 is 112210212110101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101011212012211 - 23 = 101011212012203 is a prime.
It is a super-2 number, since 2×1010112120122112 (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 (101011212012241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 125634220 + ... + 126435673.
It is an arithmetic number, because the mean of its divisors is an integer number (12816997900218).
Almost surely, 2101011212012211 is an apocalyptic number.
101011212012211 is a deficient number, since it is larger than the sum of its proper divisors (1524771189533).
101011212012211 is an equidigital number, since it uses as much as digits as its factorization.
101011212012211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 252075941.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101011212012211 its reverse (112210212110101), we get a palindrome (213221424122312).
The spelling of 101011212012211 in words is "one hundred one trillion, eleven billion, two hundred twelve million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.297 sec. • engine limits •