Base | Representation |
---|---|
bin | 10110111110000010001110… |
… | …011010011111011101101011 |
3 | 111020200102022220002222102011 |
4 | 112332002032122133131223 |
5 | 101220103000122024321 |
6 | 554503542341420351 |
7 | 30164312162056405 |
oct | 2676021632373553 |
9 | 436612286088364 |
10 | 101020020111211 |
11 | 2a208393847a23 |
12 | b3b643440a6b7 |
13 | 444a1bb00b326 |
14 | 1ad3576097b75 |
15 | ba2b68925ae1 |
hex | 5be08e69f76b |
101020020111211 has 4 divisors (see below), whose sum is σ = 101021697771112. Its totient is φ = 101018342451312.
The previous prime is 101020020111209. The next prime is 101020020111379. The reversal of 101020020111211 is 112111020020101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101020020111211 - 21 = 101020020111209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101020020111191 and 101020020111200.
It is not an unprimeable number, because it can be changed into a prime (101020020111011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 838739625 + ... + 838860058.
It is an arithmetic number, because the mean of its divisors is an integer number (25255424442778).
Almost surely, 2101020020111211 is an apocalyptic number.
101020020111211 is a deficient number, since it is larger than the sum of its proper divisors (1677659901).
101020020111211 is an equidigital number, since it uses as much as digits as its factorization.
101020020111211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1677659900.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101020020111211 its reverse (112111020020101), we get a palindrome (213131040131312).
The spelling of 101020020111211 in words is "one hundred one trillion, twenty billion, twenty million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •