Base | Representation |
---|---|
bin | 10111000111110100111000… |
… | …10111011101010011100001 |
3 | 20200000212120021002201111002 |
4 | 23203322130113131103201 |
5 | 23131032010214320324 |
6 | 300050311314001345 |
7 | 13465351223662325 |
oct | 1343723427352341 |
9 | 220025507081432 |
10 | 50846446245089 |
11 | 15223947383200 |
12 | 585246bb76255 |
13 | 224aa511014c1 |
14 | c7ada430b985 |
15 | 5d297581c3ae |
hex | 2e3e9c5dd4e1 |
50846446245089 has 12 divisors (see below), whose sum is σ = 55945924758528. Its totient is φ = 46177018492440.
The previous prime is 50846446245083. The next prime is 50846446245149. The reversal of 50846446245089 is 98054264464805.
It is not a de Polignac number, because 50846446245089 - 244 = 33254260200673 is a prime.
It is a super-2 number, since 2×508464462450892 (a number of 28 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (65) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50846446245083) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 213623969 + ... + 213861854.
It is an arithmetic number, because the mean of its divisors is an integer number (4662160396544).
Almost surely, 250846446245089 is an apocalyptic number.
It is an amenable number.
50846446245089 is a deficient number, since it is larger than the sum of its proper divisors (5099478513439).
50846446245089 is a wasteful number, since it uses less digits than its factorization.
50846446245089 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 427486828 (or 427486817 counting only the distinct ones).
The product of its (nonzero) digits is 265420800, while the sum is 65.
The spelling of 50846446245089 in words is "fifty trillion, eight hundred forty-six billion, four hundred forty-six million, two hundred forty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •