Base | Representation |
---|---|
bin | 111010000110001110111010… |
… | …0101000000010000001000011 |
3 | 2111000101222212212102101111110 |
4 | 1310030131310220002001003 |
5 | 1013440204020402243133 |
6 | 5010511544134214403 |
7 | 212432463020611323 |
oct | 16414356450020103 |
9 | 2430358785371443 |
10 | 511030050431043 |
11 | 138914699a40360 |
12 | 49395069ab4403 |
13 | 18c1bc08759490 |
14 | 9029db4a07283 |
15 | 3e130e7343c63 |
hex | 1d0c774a02043 |
511030050431043 has 64 divisors (see below), whose sum is σ = 802104713528832. Its totient is φ = 285316144174080.
The previous prime is 511030050431039. The next prime is 511030050431063. The reversal of 511030050431043 is 340134050030115.
It is not a de Polignac number, because 511030050431043 - 22 = 511030050431039 is a prime.
It is a super-2 number, since 2×5110300504310432 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 511030050431043.
It is not an unprimeable number, because it can be changed into a prime (511030050431063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1037595321 + ... + 1038087717.
It is an arithmetic number, because the mean of its divisors is an integer number (12532886148888).
Almost surely, 2511030050431043 is an apocalyptic number.
511030050431043 is a deficient number, since it is larger than the sum of its proper divisors (291074663097789).
511030050431043 is a wasteful number, since it uses less digits than its factorization.
511030050431043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497284.
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 511030050431043 in words is "five hundred eleven trillion, thirty billion, fifty million, four hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •