Search a number
-
+
5303534512132 = 2210321511284583
BaseRepresentation
bin100110100101101001101…
…0010100110100000000100
3200210000100102211222022001
41031023103102212200010
51143343114313342012
615140224330315044
71055111346354553
oct115132322464004
920700312758261
105303534512132
111765241a7306a
12717a3ab88a84
132c617625416c
1414499a0abd9a
1592e55358357
hex4d2d34a6804

5303534512132 has 12 divisors (see below), whose sum is σ = 9281201613376. Its totient is φ = 2651762622600.

The previous prime is 5303534512121. The next prime is 5303534512181. The reversal of 5303534512132 is 2312154353035.

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

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3486313 + ... + 4770895.

Almost surely, 25303534512132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 162000, while the sum is 37.

Adding to 5303534512132 its reverse (2312154353035), we get a palindrome (7615688865167).

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

Divisors: 1 2 4 1032151 1284583 2064302 2569166 4128604 5138332 1325883628033 2651767256066 5303534512132