Base | Representation |
---|---|
bin | 1001000111100010100000… |
… | …01001011111010000100110 |
3 | 2121222210012112110201111200 |
4 | 10203301100021133100212 |
5 | 10112000404003033332 |
6 | 110350543020543330 |
7 | 4136403636006222 |
oct | 443612011372046 |
9 | 77883175421450 |
10 | 20050252002342 |
11 | 643029a601191 |
12 | 22b9a589b1b46 |
13 | b25966317673 |
14 | 4d461a229782 |
15 | 24b84690817c |
hex | 123c5025f426 |
20050252002342 has 48 divisors (see below), whose sum is σ = 44655091333632. Its totient is φ = 6497134502400.
The previous prime is 20050252002329. The next prime is 20050252002343. The reversal of 20050252002342 is 24320025205002.
20050252002342 is a `hidden beast` number, since 20 + 0 + 50 + 252 + 0 + 0 + 2 + 342 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20050252002343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12311403 + ... + 13844534.
It is an arithmetic number, because the mean of its divisors is an integer number (930314402784).
Almost surely, 220050252002342 is an apocalyptic number.
20050252002342 is an abundant number, since it is smaller than the sum of its proper divisors (24604839331290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20050252002342 is a wasteful number, since it uses less digits than its factorization.
20050252002342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26157133 (or 26157130 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
Adding to 20050252002342 its reverse (24320025205002), we get a palindrome (44370277207344).
The spelling of 20050252002342 in words is "twenty trillion, fifty billion, two hundred fifty-two million, two thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •