Base | Representation |
---|---|
bin | 10111000010001100100110… |
… | …11101010101001110101100 |
3 | 20122100101022021122002112020 |
4 | 23201012103131111032230 |
5 | 23114344342423332422 |
6 | 255421402212110140 |
7 | 13445363064516522 |
oct | 1341062335251654 |
9 | 218311267562466 |
10 | 50653023261612 |
11 | 15159910122952 |
12 | 5820a8b005350 |
13 | 223573758a5a5 |
14 | c7189591c312 |
15 | 5cc9049ad95c |
hex | 2e11937553ac |
50653023261612 has 48 divisors (see below), whose sum is σ = 118386687213312. Its totient is φ = 16856302357440.
The previous prime is 50653023261611. The next prime is 50653023261619. The reversal of 50653023261612 is 21616232035605.
It is a happy number.
50653023261612 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (50653023261611) by changing a digit.
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, 102148818 + ... + 102643494.
It is an arithmetic number, because the mean of its divisors is an integer number (2466389316944).
Almost surely, 250653023261612 is an apocalyptic number.
It is an amenable number.
50653023261612 is an abundant number, since it is smaller than the sum of its proper divisors (67733663951700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50653023261612 is a wasteful number, since it uses less digits than its factorization.
50653023261612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 508838 (or 508836 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 42.
The spelling of 50653023261612 in words is "fifty trillion, six hundred fifty-three billion, twenty-three million, two hundred sixty-one thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •