Base | Representation |
---|---|
bin | 100000001101001111101… |
… | …101010110010001010010 |
3 | 21211120202212202212110000 |
4 | 200031033231112101102 |
5 | 242230211313221302 |
6 | 4412430110550430 |
7 | 315621166611261 |
oct | 40151755262122 |
9 | 7746685685400 |
10 | 2213245445202 |
11 | 7836a539a010 |
12 | 2b8b37508416 |
13 | 130928a6168c |
14 | 7919bb4c5d8 |
15 | 3c8891d831c |
hex | 2034fb56452 |
2213245445202 has 40 divisors (see below), whose sum is σ = 5410155537072. Its totient is φ = 670680437400.
The previous prime is 2213245445183. The next prime is 2213245445207. The reversal of 2213245445202 is 2025445423122.
2213245445202 is a `hidden beast` number, since 2 + 2 + 1 + 3 + 2 + 4 + 5 + 445 + 202 = 666.
It is not an unprimeable number, because it can be changed into a prime (2213245445207) 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 19 ways as a sum of consecutive naturals, for example, 620998624 + ... + 621002187.
Almost surely, 22213245445202 is an apocalyptic number.
2213245445202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2213245445202 is an abundant number, since it is smaller than the sum of its proper divisors (3196910091870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2213245445202 is a wasteful number, since it uses less digits than its factorization.
2213245445202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242000836 (or 1242000827 counting only the distinct ones).
The product of its (nonzero) digits is 153600, while the sum is 36.
It can be divided in two parts, 221 and 3245445202, that added together give a palindrome (3245445423).
The spelling of 2213245445202 in words is "two trillion, two hundred thirteen billion, two hundred forty-five million, four hundred forty-five thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •