Base | Representation |
---|---|
bin | 11001010111101001… |
… | …00100001000000000 |
3 | 1022011012121211222121 |
4 | 30223310210020000 |
5 | 210343221223012 |
6 | 10131302014024 |
7 | 661342645054 |
oct | 145364441000 |
9 | 38135554877 |
10 | 13620101632 |
11 | 585a212a45 |
12 | 2781417314 |
13 | 13909b8047 |
14 | 932c65c64 |
15 | 54aae0a07 |
hex | 32bd24200 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •