Search a number
-
+
13620101632 = 2940196619
BaseRepresentation
bin11001010111101001…
…00100001000000000
31022011012121211222121
430223310210020000
5210343221223012
610131302014024
7661342645054
oct145364441000
938135554877
1013620101632
11585a212a45
122781417314
1313909b8047
14932c65c64
1554aae0a07
hex32bd24200

13620101632 has 40 divisors (see below), whose sum is σ = 27224485200. Its totient is φ = 6807327744.

The previous prime is 13620101617. The next prime is 13620101639. The reversal of 13620101632 is 23610102631.

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

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

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

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

Almost surely, 213620101632 is an apocalyptic number.

It is an amenable number.

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

13620101632 is an frugal number, since it uses more digits than its factorization.

13620101632 is an evil number, because the sum of its binary digits is even.

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

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

Subtracting 13620101632 from its reverse (23610102631), we obtain a palindrome (9990000999).

The spelling of 13620101632 in words is "thirteen billion, six hundred twenty million, one hundred one thousand, six hundred thirty-two".

Divisors: 1 2 4 8 16 32 64 128 256 512 4019 6619 8038 13238 16076 26476 32152 52952 64304 105904 128608 211808 257216 423616 514432 847232 1028864 1694464 2057728 3388928 26601761 53203522 106407044 212814088 425628176 851256352 1702512704 3405025408 6810050816 13620101632