Base | Representation |
---|---|
bin | 10001011111101001011… |
… | …011111110110110000101 |
3 | 11020221010020112201002110 |
4 | 101133221123332312011 |
5 | 124144112322132323 |
6 | 2320142205531233 |
7 | 152566640650506 |
oct | 21375133766605 |
9 | 4227106481073 |
10 | 1202212302213 |
11 | 42394555952a |
12 | 174bb6573b19 |
13 | 894a2a35a80 |
14 | 4228a288bad |
15 | 21414037793 |
hex | 117e96fed85 |
1202212302213 has 16 divisors (see below), whose sum is σ = 1726474833216. Its totient is φ = 739728124800.
The previous prime is 1202212302163. The next prime is 1202212302259. The reversal of 1202212302213 is 3122032122021.
It is not a de Polignac number, because 1202212302213 - 210 = 1202212301189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1202212302213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202212372213) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1666863 + ... + 2276588.
It is an arithmetic number, because the mean of its divisors is an integer number (107904677076).
Almost surely, 21202212302213 is an apocalyptic number.
1202212302213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1202212302213 is a deficient number, since it is larger than the sum of its proper divisors (524262531003).
1202212302213 is a wasteful number, since it uses less digits than its factorization.
1202212302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3951284.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1202212302213 its reverse (3122032122021), we get a palindrome (4324244424234).
The spelling of 1202212302213 in words is "one trillion, two hundred two billion, two hundred twelve million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •