Base | Representation |
---|---|
bin | 11000011001011110… |
… | …10100010100011110 |
3 | 1020210212101110210020 |
4 | 30030233110110132 |
5 | 203311222214403 |
6 | 10003433053010 |
7 | 642411352611 |
oct | 141457242436 |
9 | 36725343706 |
10 | 13098632478 |
11 | 56119224a8 |
12 | 2656857166 |
13 | 1309956c09 |
14 | 8c38c2178 |
15 | 519e36453 |
hex | 30cbd451e |
13098632478 has 32 divisors (see below), whose sum is σ = 27833081760. Its totient is φ = 4101713280.
The previous prime is 13098632473. The next prime is 13098632489. The reversal of 13098632478 is 87423689031.
13098632478 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
13098632478 is a modest number, since divided by 632478 gives 13098 as remainder.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13098632478.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13098632473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1010853 + ... + 1023728.
It is an arithmetic number, because the mean of its divisors is an integer number (869783805).
Almost surely, 213098632478 is an apocalyptic number.
13098632478 is an abundant number, since it is smaller than the sum of its proper divisors (14734449282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13098632478 is a wasteful number, since it uses less digits than its factorization.
13098632478 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2034652.
The product of its (nonzero) digits is 1741824, while the sum is 51.
The spelling of 13098632478 in words is "thirteen billion, ninety-eight million, six hundred thirty-two thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •