Search a number
-
+
1362112654452 = 223111923103922727
BaseRepresentation
bin10011110100100100001…
…111011010110001110100
311211012211222021020001120
4103310210033122301310
5134304101314420302
62521425041223540
7200260264346454
oct23644417326164
94735758236046
101362112654452
1148573a0a0870
1219bba0931bb0
139b5a6453304
1449cd885dd64
1525671d8e9bc
hex13d243dac74

1362112654452 has 192 divisors, whose sum is σ = 3812194713600. Its totient is φ = 373659073920.

The previous prime is 1362112654421. The next prime is 1362112654457. The reversal of 1362112654452 is 2544562112631.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1362112654457) by changing a digit.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 59922313 + ... + 59945039.

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

Almost surely, 21362112654452 is an apocalyptic number.

1362112654452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1362112654452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1906097356800).

1362112654452 is an abundant number, since it is smaller than the sum of its proper divisors (2450082059148).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its digits is 345600, while the sum is 42.

The spelling of 1362112654452 in words is "one trillion, three hundred sixty-two billion, one hundred twelve million, six hundred fifty-four thousand, four hundred fifty-two".