Base | Representation |
---|---|
bin | 11110100110100101000… |
… | …01011111001011011011 |
3 | 10201112010010022102111201 |
4 | 33103102201133023123 |
5 | 114211440011422133 |
6 | 2123015420135031 |
7 | 135653151435250 |
oct | 17232241371333 |
9 | 3645103272451 |
10 | 1051504014043 |
11 | 375a3866aa5a |
12 | 14b956697477 |
13 | 782058048b2 |
14 | 38c70803427 |
15 | 1c543199d7d |
hex | f4d285f2db |
1051504014043 has 8 divisors (see below), whose sum is σ = 1202101977312. Its totient is φ = 901001826816.
The previous prime is 1051504014023. The next prime is 1051504014097. The reversal of 1051504014043 is 3404104051501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1051504014043 is a prime.
It is a super-2 number, since 2×10515040140432 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1051504014023) 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 7 ways as a sum of consecutive naturals, for example, 23920480 + ... + 23964397.
It is an arithmetic number, because the mean of its divisors is an integer number (150262747164).
Almost surely, 21051504014043 is an apocalyptic number.
1051504014043 is a deficient number, since it is larger than the sum of its proper divisors (150597963269).
1051504014043 is an equidigital number, since it uses as much as digits as its factorization.
1051504014043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47888021.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1051504014043 its reverse (3404104051501), we get a palindrome (4455608065544).
The spelling of 1051504014043 in words is "one trillion, fifty-one billion, five hundred four million, fourteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •