Base | Representation |
---|---|
bin | 100000001101001000111… |
… | …110010001011010010001 |
3 | 21211120111000010200010211 |
4 | 200031020332101122101 |
5 | 242224443401104413 |
6 | 4412410552524121 |
7 | 315615325235530 |
oct | 40151076213221 |
9 | 7746430120124 |
10 | 2213132441233 |
11 | 7836476264aa |
12 | 2b8b056b0641 |
13 | 13090b516c1c |
14 | 7918ab34317 |
15 | 3c87e31583d |
hex | 20348f91691 |
2213132441233 has 16 divisors (see below), whose sum is σ = 2678644180224. Its totient is φ = 1785005521920.
The previous prime is 2213132441197. The next prime is 2213132441249. The reversal of 2213132441233 is 3321442313122.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2213132441233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2213132441195 and 2213132441204.
It is not an unprimeable number, because it can be changed into a prime (2213132441633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1407885 + ... + 2531482.
It is an arithmetic number, because the mean of its divisors is an integer number (167415261264).
Almost surely, 22213132441233 is an apocalyptic number.
It is an amenable number.
2213132441233 is a deficient number, since it is larger than the sum of its proper divisors (465511738991).
2213132441233 is a wasteful number, since it uses less digits than its factorization.
2213132441233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3944112.
The product of its digits is 20736, while the sum is 31.
Adding to 2213132441233 its reverse (3321442313122), we get a palindrome (5534574754355).
The spelling of 2213132441233 in words is "two trillion, two hundred thirteen billion, one hundred thirty-two million, four hundred forty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •