Base | Representation |
---|---|
bin | 100100101111100110000… |
… | …0111001100011110111001 |
3 | 122212202221221122201021220 |
4 | 1021133030013030132321 |
5 | 1130214410304323001 |
6 | 14423535410022253 |
7 | 1030564660225005 |
oct | 111371407143671 |
9 | 18782857581256 |
10 | 5050011011001 |
11 | 1677774620310 |
12 | 696886577989 |
13 | 2a82a21baa78 |
14 | 1365c9741705 |
15 | 8b56803dc36 |
hex | 497cc1cc7b9 |
5050011011001 has 64 divisors (see below), whose sum is σ = 7449200640000. Its totient is φ = 3017773658880.
The previous prime is 5050011010999. The next prime is 5050011011021. The reversal of 5050011011001 is 1001101100505.
It is not a de Polignac number, because 5050011011001 - 21 = 5050011010999 is a prime.
It is a super-2 number, since 2×50500110110012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5050011011021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 393633855 + ... + 393646683.
It is an arithmetic number, because the mean of its divisors is an integer number (116393760000).
Almost surely, 25050011011001 is an apocalyptic number.
It is an amenable number.
5050011011001 is a deficient number, since it is larger than the sum of its proper divisors (2399189628999).
5050011011001 is a wasteful number, since it uses less digits than its factorization.
5050011011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13574.
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 5050011011001 its reverse (1001101100505), we get a palindrome (6051112111506).
The spelling of 5050011011001 in words is "five trillion, fifty billion, eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •