Base | Representation |
---|---|
bin | 10001100111010100100… |
… | …100110110111001100110 |
3 | 11021201101111110000112100 |
4 | 101213110210312321212 |
5 | 124313001233221042 |
6 | 2324024000232530 |
7 | 153311064202602 |
oct | 21472444667146 |
9 | 4251344400470 |
10 | 1210452242022 |
11 | 427393809241 |
12 | 17671600b746 |
13 | 8a1b6ba84ba |
14 | 4282c770502 |
15 | 2174762b24c |
hex | 119d4936e66 |
1210452242022 has 72 divisors (see below), whose sum is σ = 2768749149816. Its totient is φ = 382137098112.
The previous prime is 1210452241979. The next prime is 1210452242047. The reversal of 1210452242022 is 2202422540121.
1210452242022 is a `hidden beast` number, since 1 + 2 + 1 + 0 + 452 + 2 + 4 + 202 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 23997913 + ... + 24048299.
It is an arithmetic number, because the mean of its divisors is an integer number (38454849303).
Almost surely, 21210452242022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1210452242022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1384374574908).
1210452242022 is an abundant number, since it is smaller than the sum of its proper divisors (1558296907794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210452242022 is a wasteful number, since it uses less digits than its factorization.
1210452242022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54130 (or 54108 counting only the distinct ones).
The product of its (nonzero) digits is 5120, while the sum is 27.
Adding to 1210452242022 its reverse (2202422540121), we get a palindrome (3412874782143).
The spelling of 1210452242022 in words is "one trillion, two hundred ten billion, four hundred fifty-two million, two hundred forty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •