Base | Representation |
---|---|
bin | 10110110100100010111000… |
… | …11111011110111110111111 |
3 | 20120200112112201212100222221 |
4 | 23122101130133132332333 |
5 | 23034203212102044321 |
6 | 254422104352350211 |
7 | 13366446024534352 |
oct | 1332213437367677 |
9 | 216615481770887 |
10 | 50183949643711 |
11 | 14a98991310024 |
12 | 5765b9b245367 |
13 | 22004317075c0 |
14 | c56cb7baa299 |
15 | 5c05ede92e41 |
hex | 2da45c7defbf |
50183949643711 has 16 divisors (see below), whose sum is σ = 56226889105408. Its totient is φ = 44476347736800.
The previous prime is 50183949643693. The next prime is 50183949643717. The reversal of 50183949643711 is 11734694938105.
It is a cyclic number.
It is not a de Polignac number, because 50183949643711 - 29 = 50183949643199 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50183949643711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50183949643717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 490208385 + ... + 490310746.
It is an arithmetic number, because the mean of its divisors is an integer number (3514180569088).
Almost surely, 250183949643711 is an apocalyptic number.
50183949643711 is a deficient number, since it is larger than the sum of its proper divisors (6042939461697).
50183949643711 is a wasteful number, since it uses less digits than its factorization.
50183949643711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 980519302.
The product of its (nonzero) digits is 19595520, while the sum is 61.
The spelling of 50183949643711 in words is "fifty trillion, one hundred eighty-three billion, nine hundred forty-nine million, six hundred forty-three thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •