Base | Representation |
---|---|
bin | 110111000100110010111011… |
… | …011011101011110101010000 |
3 | 1011202122012122000210022110001 |
4 | 313010302323123223311100 |
5 | 223222031400234101112 |
6 | 2215055150022015344 |
7 | 102006653641536556 |
oct | 6704627333536520 |
9 | 1152565560708401 |
10 | 242222120222032 |
11 | 701a7908169635 |
12 | 23200329b77554 |
13 | a5205a9132b42 |
14 | 43b5882787bd6 |
15 | 1d00b47187c57 |
hex | dc4cbb6ebd50 |
242222120222032 has 20 divisors (see below), whose sum is σ = 485488301308020. Its totient is φ = 116934816658688.
The previous prime is 242222120221981. The next prime is 242222120222041. The reversal of 242222120222032 is 230222021222242.
It can be written as a sum of positive squares in 2 ways, for example, as 166082604388416 + 76139515833616 = 12887304^2 + 8725796^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 261015215293 + ... + 261015216220.
It is an arithmetic number, because the mean of its divisors is an integer number (24274415065401).
Almost surely, 2242222120222032 is an apocalyptic number.
It is an amenable number.
242222120222032 is an abundant number, since it is smaller than the sum of its proper divisors (243266181085988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242222120222032 is a wasteful number, since it uses less digits than its factorization.
242222120222032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 522030431550 (or 522030431544 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 28.
Adding to 242222120222032 its reverse (230222021222242), we get a palindrome (472444141444274).
The spelling of 242222120222032 in words is "two hundred forty-two trillion, two hundred twenty-two billion, one hundred twenty million, two hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •