Base | Representation |
---|---|
bin | 1010000011001110101110… |
… | …11111001011010100110101 |
3 | 2220020212010011101100111010 |
4 | 11001213113133023110311 |
5 | 10344101300313342323 |
6 | 115001054454102433 |
7 | 4440521612313201 |
oct | 501472737132465 |
9 | 86225104340433 |
10 | 22101222012213 |
11 | 7051091714873 |
12 | 258b44664aa19 |
13 | c441a0588296 |
14 | 5659c218bb01 |
15 | 284d844d5c93 |
hex | 1419d77cb535 |
22101222012213 has 8 divisors (see below), whose sum is σ = 29468408197248. Its totient is φ = 14734091917664.
The previous prime is 22101222012053. The next prime is 22101222012217. The reversal of 22101222012213 is 31221022210122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22101222012213 - 225 = 22101188457781 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22101222012213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22101222012217) 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, 13094445 + ... + 14685602.
It is an arithmetic number, because the mean of its divisors is an integer number (3683551024656).
Almost surely, 222101222012213 is an apocalyptic number.
It is an amenable number.
22101222012213 is a deficient number, since it is larger than the sum of its proper divisors (7367186185035).
22101222012213 is a wasteful number, since it uses less digits than its factorization.
22101222012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28045243.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 22101222012213 its reverse (31221022210122), we get a palindrome (53322244222335).
The spelling of 22101222012213 in words is "twenty-two trillion, one hundred one billion, two hundred twenty-two million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •