Base | Representation |
---|---|
bin | 10110111100011100100001… |
… | …10100001111101110100011 |
3 | 20121122111020022020200200210 |
4 | 23132032100310033232203 |
5 | 23103130140033103443 |
6 | 255150521235345203 |
7 | 13425166051331532 |
oct | 1336162064175643 |
9 | 217574208220623 |
10 | 50455410441123 |
11 | 15093023907a86 |
12 | 57aa71aa52203 |
13 | 221cc039b878c |
14 | c660aa8c0319 |
15 | 5c76dadcbc33 |
hex | 2de390d0fba3 |
50455410441123 has 4 divisors (see below), whose sum is σ = 67273880588168. Its totient is φ = 33636940294080.
The previous prime is 50455410441017. The next prime is 50455410441133. The reversal of 50455410441123 is 32114401455405.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 50455410441123 - 217 = 50455410310051 is a prime.
It is a super-2 number, since 2×504554104411232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50455410441133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8409235073518 + ... + 8409235073523.
It is an arithmetic number, because the mean of its divisors is an integer number (16818470147042).
Almost surely, 250455410441123 is an apocalyptic number.
50455410441123 is a deficient number, since it is larger than the sum of its proper divisors (16818470147045).
50455410441123 is a wasteful number, since it uses less digits than its factorization.
50455410441123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16818470147044.
The product of its (nonzero) digits is 192000, while the sum is 39.
Adding to 50455410441123 its reverse (32114401455405), we get a palindrome (82569811896528).
The spelling of 50455410441123 in words is "fifty trillion, four hundred fifty-five billion, four hundred ten million, four hundred forty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •