Base | Representation |
---|---|
bin | 10110110010100011100001… |
… | …10011110110101000110101 |
3 | 20120110000001022110221212102 |
4 | 23121101300303312220311 |
5 | 23032043142142113221 |
6 | 254330435302031445 |
7 | 13361505366225005 |
oct | 1331216063665065 |
9 | 216400038427772 |
10 | 50115571051061 |
11 | 14a7199239132a |
12 | 5754897418585 |
13 | 21c6b5517c8a9 |
14 | c5386c65c005 |
15 | 5bd94adae30b |
hex | 2d9470cf6a35 |
50115571051061 has 4 divisors (see below), whose sum is σ = 50120419235052. Its totient is φ = 50110722867072.
The previous prime is 50115571050983. The next prime is 50115571051069. The reversal of 50115571051061 is 16015017551105.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 27463825472836 + 22651745578225 = 5240594^2 + 4759385^2 .
It is a cyclic number.
It is not a de Polignac number, because 50115571051061 - 222 = 50115566856757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50115571051069) 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, 2424076490 + ... + 2424097163.
It is an arithmetic number, because the mean of its divisors is an integer number (12530104808763).
Almost surely, 250115571051061 is an apocalyptic number.
It is an amenable number.
50115571051061 is a deficient number, since it is larger than the sum of its proper divisors (4848183991).
50115571051061 is a wasteful number, since it uses less digits than its factorization.
50115571051061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4848183990.
The product of its (nonzero) digits is 26250, while the sum is 38.
The spelling of 50115571051061 in words is "fifty trillion, one hundred fifteen billion, five hundred seventy-one million, fifty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •