Search a number
-
+
1003301533132 = 22250825383283
BaseRepresentation
bin11101001100110010110…
…11100111010111001100
310112220200210211200111221
432212121123213113030
5112414230143030012
62044524345453124
7132325514215033
oct16463133472714
93486623750457
101003301533132
11357552617678
121425437a11a4
13737c3296942
14367bab0171a
151b17151d507
hexe9996e75cc

1003301533132 has 6 divisors (see below), whose sum is σ = 1755777682988. Its totient is φ = 501650766564.

The previous prime is 1003301533121. The next prime is 1003301533151. The reversal of 1003301533132 is 2313351033001.

It is a super-2 number, since 2×10033015331322 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1003301533097 and 1003301533106.

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 125412691638 + ... + 125412691645.

Almost surely, 21003301533132 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 250825383287 (or 250825383285 counting only the distinct ones).

The product of its (nonzero) digits is 2430, while the sum is 25.

Adding to 1003301533132 its reverse (2313351033001), we get a palindrome (3316652566133).

The spelling of 1003301533132 in words is "one trillion, three billion, three hundred one million, five hundred thirty-three thousand, one hundred thirty-two".

Divisors: 1 2 4 250825383283 501650766566 1003301533132