Base | Representation |
---|---|
bin | 11001011101101000… |
… | …00010110000111110 |
3 | 1022021201002000120220 |
4 | 30232310002300332 |
5 | 210444043443023 |
6 | 10140253522210 |
7 | 662522414145 |
oct | 145664026076 |
9 | 38251060526 |
10 | 13670296638 |
11 | 5885587219 |
12 | 27961a3366 |
13 | 139b21112b |
14 | 9397b075c |
15 | 5502083e3 |
hex | 32ed02c3e |
13670296638 has 8 divisors (see below), whose sum is σ = 27340593288. Its totient is φ = 4556765544.
The previous prime is 13670296613. The next prime is 13670296663. The reversal of 13670296638 is 83669207631.
13670296638 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13670296613) and next prime (13670296663).
It is a sphenic number, since it is the product of 3 distinct primes.
13670296638 is an admirable number.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1139191381 + ... + 1139191392.
It is an arithmetic number, because the mean of its divisors is an integer number (3417574161).
Almost surely, 213670296638 is an apocalyptic number.
13670296638 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13670296638 is a wasteful number, since it uses less digits than its factorization.
13670296638 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2278382778.
The product of its (nonzero) digits is 1959552, while the sum is 51.
The spelling of 13670296638 in words is "thirteen billion, six hundred seventy million, two hundred ninety-six thousand, six hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •