Base | Representation |
---|---|
bin | 10110111111010110111110… |
… | …100011111010010110011110 |
3 | 111021000010012222121002020022 |
4 | 112333112332203322112132 |
5 | 101223100333140401342 |
6 | 555013432400152142 |
7 | 30204013250054306 |
oct | 2677267643722636 |
9 | 437003188532208 |
10 | 101111022200222 |
11 | 2a242a42089351 |
12 | b40bbb0908652 |
13 | 445596161c588 |
14 | 1ad7b2a0c8606 |
15 | ba51e2c479d2 |
hex | 5bf5be8fa59e |
101111022200222 has 8 divisors (see below), whose sum is σ = 151666576063056. Its totient is φ = 50555496845872.
The previous prime is 101111022200203. The next prime is 101111022200257. The reversal of 101111022200222 is 222002220111101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1011110222002222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101111022200222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9465098 + ... + 17082450.
It is an arithmetic number, because the mean of its divisors is an integer number (18958322007882).
Almost surely, 2101111022200222 is an apocalyptic number.
101111022200222 is a deficient number, since it is larger than the sum of its proper divisors (50555553862834).
101111022200222 is an equidigital number, since it uses as much as digits as its factorization.
101111022200222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14254242.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101111022200222 its reverse (222002220111101), we get a palindrome (323113242311323).
The spelling of 101111022200222 in words is "one hundred one trillion, one hundred eleven billion, twenty-two million, two hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •