Base | Representation |
---|---|
bin | 11001010111101001… |
… | …00100000111111110 |
3 | 1022011012121211222112 |
4 | 30223310210013332 |
5 | 210343221223010 |
6 | 10131302014022 |
7 | 661342645052 |
oct | 145364440776 |
9 | 38135554875 |
10 | 13620101630 |
11 | 585a212a43 |
12 | 2781417312 |
13 | 13909b8045 |
14 | 932c65c62 |
15 | 54aae0a05 |
hex | 32bd241fe |
13620101630 has 32 divisors (see below), whose sum is σ = 24856481664. Its totient is φ = 5372657056.
The previous prime is 13620101617. The next prime is 13620101639. The reversal of 13620101630 is 3610102631.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13620101596 and 13620101605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13620101639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 452717 + ... + 481863.
It is an arithmetic number, because the mean of its divisors is an integer number (776765052).
Almost surely, 213620101630 is an apocalyptic number.
13620101630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13620101630 is a deficient number, since it is larger than the sum of its proper divisors (11236380034).
13620101630 is a wasteful number, since it uses less digits than its factorization.
13620101630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29800.
The product of its (nonzero) digits is 648, while the sum is 23.
The spelling of 13620101630 in words is "thirteen billion, six hundred twenty million, one hundred one thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •