Base | Representation |
---|---|
bin | 101111000101101011… |
… | …0101010000010110101 |
3 | 100200000101022000222022 |
4 | 1132023112222002311 |
5 | 3124044242021323 |
6 | 114242132042525 |
7 | 10206621455360 |
oct | 1361326520265 |
9 | 320011260868 |
10 | 101122220213 |
11 | 39981947823 |
12 | 17721763445 |
13 | 96c7170281 |
14 | 4c741050d7 |
15 | 296ca0e4c8 |
hex | 178b5aa0b5 |
101122220213 has 8 divisors (see below), whose sum is σ = 115604814528. Its totient is φ = 86648766624.
The previous prime is 101122220209. The next prime is 101122220257. The reversal of 101122220213 is 312022221101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101122220213 - 22 = 101122220209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101122220191 and 101122220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101122220203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2261456 + ... + 2305737.
It is an arithmetic number, because the mean of its divisors is an integer number (14450601816).
Almost surely, 2101122220213 is an apocalyptic number.
It is an amenable number.
101122220213 is a deficient number, since it is larger than the sum of its proper divisors (14482594315).
101122220213 is an equidigital number, since it uses as much as digits as its factorization.
101122220213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4570363.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 101122220213 its reverse (312022221101), we get a palindrome (413144441314).
The spelling of 101122220213 in words is "one hundred one billion, one hundred twenty-two million, two hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •