Base | Representation |
---|---|
bin | 11110100100100101001… |
… | …00011010111000110001 |
3 | 10201102100100022202022002 |
4 | 33102102210122320301 |
5 | 114202240321303243 |
6 | 2122321130423345 |
7 | 135614442346211 |
oct | 17222244327061 |
9 | 3642310282262 |
10 | 1050431041073 |
11 | 375537a35537 |
12 | 14b6b7291b55 |
13 | 7809442794b |
14 | 38bac0dc241 |
15 | 1c4cdda1eb8 |
hex | f49291ae31 |
1050431041073 has 32 divisors (see below), whose sum is σ = 1154542204800. Its totient is φ = 951852819456.
The previous prime is 1050431041057. The next prime is 1050431041081. The reversal of 1050431041073 is 3701401340501.
It is a cyclic number.
It is not a de Polignac number, because 1050431041073 - 24 = 1050431041057 is a prime.
It is a super-2 number, since 2×10504310410732 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is not an unprimeable number, because it can be changed into a prime (1050431041043) 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 31 ways as a sum of consecutive naturals, for example, 206897411 + ... + 206902487.
It is an arithmetic number, because the mean of its divisors is an integer number (36079443900).
Almost surely, 21050431041073 is an apocalyptic number.
It is an amenable number.
1050431041073 is a deficient number, since it is larger than the sum of its proper divisors (104111163727).
1050431041073 is a wasteful number, since it uses less digits than its factorization.
1050431041073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8561.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 1050431041073 its reverse (3701401340501), we get a palindrome (4751832381574).
The spelling of 1050431041073 in words is "one trillion, fifty billion, four hundred thirty-one million, forty-one thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •