Base | Representation |
---|---|
bin | 10110111110000100001010… |
… | …01110100111001000101001 |
3 | 20121211210211222000200010221 |
4 | 23133002011032213020221 |
5 | 23110033112423213001 |
6 | 255232242321210041 |
7 | 13432205631023224 |
oct | 1337020516471051 |
9 | 217753758020127 |
10 | 50511050601001 |
11 | 15104686275691 |
12 | 57b9468790921 |
13 | 22252301041c3 |
14 | c68a683105bb |
15 | 5c8d959ca1a1 |
hex | 2df0853a7229 |
50511050601001 has 8 divisors (see below), whose sum is σ = 50731417722024. Its totient is φ = 50290714091520.
The previous prime is 50511050600987. The next prime is 50511050601017. The reversal of 50511050601001 is 10010605011505.
It can be written as a sum of positive squares in 4 ways, for example, as 26850025253401 + 23661025347600 = 5181701^2 + 4864260^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50511050601001 - 213 = 50511050592809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50511050601041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4342440 + ... + 10948921.
It is an arithmetic number, because the mean of its divisors is an integer number (6341427215253).
Almost surely, 250511050601001 is an apocalyptic number.
It is an amenable number.
50511050601001 is a deficient number, since it is larger than the sum of its proper divisors (220367121023).
50511050601001 is a wasteful number, since it uses less digits than its factorization.
50511050601001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15305771.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 50511050601001 its reverse (10010605011505), we get a palindrome (60521655612506).
The spelling of 50511050601001 in words is "fifty trillion, five hundred eleven billion, fifty million, six hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •