Base | Representation |
---|---|
bin | 11110100011110101011… |
… | …10100011101100000111 |
3 | 10201101022110122212100220 |
4 | 33101322232203230013 |
5 | 114200430421423013 |
6 | 2122213321235423 |
7 | 135601514423055 |
oct | 17217256435407 |
9 | 3641273585326 |
10 | 1050031045383 |
11 | 375352172891 |
12 | 14b605332b73 |
13 | 7802c5b82c8 |
14 | 38b70d391d5 |
15 | 1c4a8bdeb23 |
hex | f47aba3b07 |
1050031045383 has 4 divisors (see below), whose sum is σ = 1400041393848. Its totient is φ = 700020696920.
The previous prime is 1050031045373. The next prime is 1050031045409. The reversal of 1050031045383 is 3835401300501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1050031045383 - 24 = 1050031045367 is a prime.
It is a super-2 number, since 2×10500310453832 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050031045373) 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 3 ways as a sum of consecutive naturals, for example, 175005174228 + ... + 175005174233.
It is an arithmetic number, because the mean of its divisors is an integer number (350010348462).
Almost surely, 21050031045383 is an apocalyptic number.
1050031045383 is a deficient number, since it is larger than the sum of its proper divisors (350010348465).
1050031045383 is an equidigital number, since it uses as much as digits as its factorization.
1050031045383 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350010348464.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 1050031045383 its reverse (3835401300501), we get a palindrome (4885432345884).
The spelling of 1050031045383 in words is "one trillion, fifty billion, thirty-one million, forty-five thousand, three hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •