Search a number
-
+
1050320033151 = 33730730821963
BaseRepresentation
bin11110100100010111111…
…00111101010101111111
310201102001121102222001120
433102023330331111333
5114202023412030101
62122302123242023
7135611623656024
oct17221374752577
93642047388046
101050320033151
11375490305654
1214b686079313
137807742b89c
1438b9b48354b
151c4c4275b36
hexf48bf3d57f

1050320033151 has 16 divisors (see below), whose sum is σ = 1442961066624. Its totient is φ = 679069466784.

The previous prime is 1050320033093. The next prime is 1050320033167. The reversal of 1050320033151 is 1513300230501.

It is not a de Polignac number, because 1050320033151 - 27 = 1050320033023 is a prime.

It is a super-2 number, since 2×10503200331512 (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 (1050320033951) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15376905 + ... + 15445058.

It is an arithmetic number, because the mean of its divisors is an integer number (90185066664).

Almost surely, 21050320033151 is an apocalyptic number.

1050320033151 is a deficient number, since it is larger than the sum of its proper divisors (392641033473).

1050320033151 is a wasteful number, since it uses less digits than its factorization.

1050320033151 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 30822310.

The product of its (nonzero) digits is 1350, while the sum is 24.

Adding to 1050320033151 its reverse (1513300230501), we get a palindrome (2563620263652).

The spelling of 1050320033151 in words is "one trillion, fifty billion, three hundred twenty million, thirty-three thousand, one hundred fifty-one".

Divisors: 1 3 37 111 307 921 11359 34077 30821963 92465889 1140412631 3421237893 9462342641 28387027923 350106677717 1050320033151