Base | Representation |
---|---|
bin | 1010000110011101011100… |
… | …10111011010010010110100 |
3 | 2220122110120111102021120121 |
4 | 11003032232113122102310 |
5 | 10402411042010311322 |
6 | 115124051104341324 |
7 | 4451531024334115 |
oct | 503165627322264 |
9 | 86573514367517 |
10 | 22212201260212 |
11 | 70941615a4447 |
12 | 25a8a59314844 |
13 | c517a8907872 |
14 | 56b10d43a20c |
15 | 287bcc560ec7 |
hex | 1433ae5da4b4 |
22212201260212 has 12 divisors (see below), whose sum is σ = 38877436355940. Its totient is φ = 11104362301376.
The previous prime is 22212201260203. The next prime is 22212201260213. The reversal of 22212201260212 is 21206210221222.
It can be written as a sum of positive squares in 2 ways, for example, as 73632993316 + 22138568266896 = 271354^2 + 4705164^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22212201260213) 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 3 ways as a sum of consecutive naturals, for example, 434553433 + ... + 434604544.
It is an arithmetic number, because the mean of its divisors is an integer number (3239786362995).
Almost surely, 222212201260212 is an apocalyptic number.
It is an amenable number.
22212201260212 is a deficient number, since it is larger than the sum of its proper divisors (16665235095728).
22212201260212 is a wasteful number, since it uses less digits than its factorization.
22212201260212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869164370 (or 869164368 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 22212201260212 its reverse (21206210221222), we get a palindrome (43418411481434).
The spelling of 22212201260212 in words is "twenty-two trillion, two hundred twelve billion, two hundred one million, two hundred sixty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •