Base | Representation |
---|---|
bin | 11001011000110010… |
… | …00100010001000000 |
3 | 1022011212121222221210 |
4 | 30230121010101000 |
5 | 210403143423324 |
6 | 10132243050120 |
7 | 661520200404 |
oct | 145431042100 |
9 | 38155558853 |
10 | 13629670464 |
11 | 5864659173 |
12 | 2784670940 |
13 | 1392988587 |
14 | 934237104 |
15 | 54b880d29 |
hex | 32c644440 |
13629670464 has 112 divisors (see below), whose sum is σ = 38647225728. Its totient is φ = 4228190208.
The previous prime is 13629670399. The next prime is 13629670469. The reversal of 13629670464 is 46407692631.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (13629670469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121684 + ... + 205100.
Almost surely, 213629670464 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 13629670464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19323612864).
13629670464 is an abundant number, since it is smaller than the sum of its proper divisors (25017555264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13629670464 is a wasteful number, since it uses less digits than its factorization.
13629670464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83492 (or 83482 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 48.
The spelling of 13629670464 in words is "thirteen billion, six hundred twenty-nine million, six hundred seventy thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •