Base | Representation |
---|---|
bin | 11001010101011010… |
… | …10100110000000000 |
3 | 1022002220111001102112 |
4 | 30222231110300000 |
5 | 210323431121212 |
6 | 10125353434452 |
7 | 661025134316 |
oct | 145255246000 |
9 | 38086431375 |
10 | 13601426432 |
11 | 584a717aa0 |
12 | 277710ba28 |
13 | 1389b79929 |
14 | 9305a40b6 |
15 | 549152422 |
hex | 32ab54c00 |
13601426432 has 88 divisors (see below), whose sum is σ = 29717035920. Its totient is φ = 6170869760.
The previous prime is 13601426429. The next prime is 13601426479. The reversal of 13601426432 is 23462410631.
It is a tau number, because it is divible by the number of its divisors (88).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9652544 + ... + 9653952.
It is an arithmetic number, because the mean of its divisors is an integer number (337693590).
Almost surely, 213601426432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13601426432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14858517960).
13601426432 is an abundant number, since it is smaller than the sum of its proper divisors (16115609488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13601426432 is a wasteful number, since it uses less digits than its factorization.
13601426432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2297 (or 2279 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 13601426432 in words is "thirteen billion, six hundred one million, four hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •