Base | Representation |
---|---|
bin | 10110111110000010011010… |
… | …010101110011110000100011 |
3 | 111020200102211211122001122020 |
4 | 112332002122111303300203 |
5 | 101220103402333211321 |
6 | 554504014250312523 |
7 | 30164320141635411 |
oct | 2676023225636043 |
9 | 436612754561566 |
10 | 101020220210211 |
11 | 2a2084867982a5 |
12 | b3b648b428743 |
13 | 444a2205cb6c3 |
14 | 1ad35948a42b1 |
15 | ba2b7b29e4c6 |
hex | 5be09a573c23 |
101020220210211 has 8 divisors (see below), whose sum is σ = 134696442817104. Its totient is φ = 67345405538400.
The previous prime is 101020220210099. The next prime is 101020220210237. The reversal of 101020220210211 is 112012022020101.
101020220210211 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101020220210211 - 210 = 101020220209187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101020220210711) 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, 351816340 + ... + 352103361.
It is an arithmetic number, because the mean of its divisors is an integer number (16837055352138).
Almost surely, 2101020220210211 is an apocalyptic number.
101020220210211 is a deficient number, since it is larger than the sum of its proper divisors (33676222606893).
101020220210211 is an equidigital number, since it uses as much as digits as its factorization.
101020220210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 703967541.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 101020220210211 its reverse (112012022020101), we get a palindrome (213032242230312).
The spelling of 101020220210211 in words is "one hundred one trillion, twenty billion, two hundred twenty million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •