Search a number
-
+
1321406610232 = 23198693464541
BaseRepresentation
bin10011001110101001111…
…110001011101100111000
311200022210002122220222011
4103032221332023230320
5133122220043011412
62451013521335304
7164316454601632
oct23165176135470
94608702586864
101321406610232
1146a450645305
12194120497534
13977ba026507
1447d565c3a52
152458d3de7a7
hex133a9f8bb38

1321406610232 has 16 divisors (see below), whose sum is σ = 2608039362600. Its totient is φ = 625929446880.

The previous prime is 1321406610203. The next prime is 1321406610233. The reversal of 1321406610232 is 2320166041231.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1321406610233) 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, 4346732119 + ... + 4346732422.

Almost surely, 21321406610232 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 31.

The spelling of 1321406610232 in words is "one trillion, three hundred twenty-one billion, four hundred six million, six hundred ten thousand, two hundred thirty-two".

Divisors: 1 2 4 8 19 38 76 152 8693464541 17386929082 34773858164 69547716328 165175826279 330351652558 660703305116 1321406610232