Base | Representation |
---|---|
bin | 10001110000011010001… |
… | …100001101011001001100 |
3 | 11022122120112121121001100 |
4 | 101300122030031121030 |
5 | 124442442242322033 |
6 | 2332320133343100 |
7 | 154104641614326 |
oct | 21603214153114 |
9 | 4278515547040 |
10 | 1220210120268 |
11 | 430540890627 |
12 | 178599a97a90 |
13 | 8b0b0681159 |
14 | 430b66a8616 |
15 | 21b1910e513 |
hex | 11c1a30d64c |
1220210120268 has 36 divisors (see below), whose sum is σ = 3084515405608. Its totient is φ = 406724129280.
The previous prime is 1220210120267. The next prime is 1220210120303. The reversal of 1220210120268 is 8620210120221.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (1220210120267) 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 11 ways as a sum of consecutive naturals, for example, 695148 + ... + 1709868.
Almost surely, 21220210120268 is an apocalyptic number.
1220210120268 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1220210120268 is an abundant number, since it is smaller than the sum of its proper divisors (1864305285340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220210120268 is a wasteful number, since it uses less digits than its factorization.
1220210120268 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1048134 (or 1048129 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 1220210120268 its reverse (8620210120221), we get a palindrome (9840420240489).
The spelling of 1220210120268 in words is "one trillion, two hundred twenty billion, two hundred ten million, one hundred twenty thousand, two hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •