Base | Representation |
---|---|
bin | 1010000100001000000111… |
… | …11110001100111111110101 |
3 | 2220100210122102220111110220 |
4 | 11002010003332030333311 |
5 | 10400102400434122401 |
6 | 115023152103004553 |
7 | 4442662261334451 |
oct | 502040376147765 |
9 | 86323572814426 |
10 | 22132033114101 |
11 | 7063162791739 |
12 | 2595405139759 |
13 | c470709bc511 |
14 | 5672a6211661 |
15 | 285a8942b336 |
hex | 142103f8cff5 |
22132033114101 has 8 divisors (see below), whose sum is σ = 29615909535264. Its totient is φ = 14701422717840.
The previous prime is 22132033114073. The next prime is 22132033114117. The reversal of 22132033114101 is 10141133023122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22132033114101 - 210 = 22132033113077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22132033114141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13316505255 + ... + 13316506916.
It is an arithmetic number, because the mean of its divisors is an integer number (3701988691908).
Almost surely, 222132033114101 is an apocalyptic number.
It is an amenable number.
22132033114101 is a deficient number, since it is larger than the sum of its proper divisors (7483876421163).
22132033114101 is a wasteful number, since it uses less digits than its factorization.
22132033114101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26633012451.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 22132033114101 its reverse (10141133023122), we get a palindrome (32273166137223).
The spelling of 22132033114101 in words is "twenty-two trillion, one hundred thirty-two billion, thirty-three million, one hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •