Base | Representation |
---|---|
bin | 10110110000101010011011… |
… | …00101001101011110100100 |
3 | 20120012210020021020210010112 |
4 | 23120111031211031132210 |
5 | 23030012014202003302 |
6 | 254240524025112152 |
7 | 13354014265164533 |
oct | 1330251545153644 |
9 | 216183207223115 |
10 | 50050555500452 |
11 | 14a47359845921 |
12 | 5744171928658 |
13 | 21c09935aa9a0 |
14 | c50661a1a31a |
15 | 5bbde3182552 |
hex | 2d854d94d7a4 |
50050555500452 has 48 divisors (see below), whose sum is σ = 100376520854400. Its totient is φ = 21632164342272.
The previous prime is 50050555500389. The next prime is 50050555500467. The reversal of 50050555500452 is 25400555505005.
50050555500452 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 142081058 + ... + 142432889.
It is an arithmetic number, because the mean of its divisors is an integer number (2091177517800).
Almost surely, 250050555500452 is an apocalyptic number.
50050555500452 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
50050555500452 is an abundant number, since it is smaller than the sum of its proper divisors (50325965353948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50050555500452 is a wasteful number, since it uses less digits than its factorization.
50050555500452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284514180 (or 284514178 counting only the distinct ones).
The product of its (nonzero) digits is 625000, while the sum is 41.
The spelling of 50050555500452 in words is "fifty trillion, fifty billion, five hundred fifty-five million, five hundred thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •