Base | Representation |
---|---|
bin | 11000010110110001… |
… | …11110100011101101 |
3 | 1020202021210120102200 |
4 | 30023120332203231 |
5 | 203234423431312 |
6 | 10001304012113 |
7 | 642015104640 |
oct | 141330764355 |
9 | 36667716380 |
10 | 13075998957 |
11 | 560007360a |
12 | 264b161039 |
13 | 1305060bb8 |
14 | 8c08ada57 |
15 | 517e650dc |
hex | 30b63e8ed |
13075998957 has 48 divisors (see below), whose sum is σ = 22216242048. Its totient is φ = 7255785600.
The previous prime is 13075998917. The next prime is 13075998967. The reversal of 13075998957 is 75989957031.
13075998957 is a `hidden beast` number, since 1 + 30 + 7 + 599 + 8 + 9 + 5 + 7 = 666.
It is not a de Polignac number, because 13075998957 - 28 = 13075998701 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 13075998894 and 13075998903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13075998917) 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 47 ways as a sum of consecutive naturals, for example, 454707 + ... + 482607.
It is an arithmetic number, because the mean of its divisors is an integer number (462838376).
Almost surely, 213075998957 is an apocalyptic number.
It is an amenable number.
13075998957 is a deficient number, since it is larger than the sum of its proper divisors (9140243091).
13075998957 is a wasteful number, since it uses less digits than its factorization.
13075998957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28130 (or 28127 counting only the distinct ones).
The product of its (nonzero) digits is 21432600, while the sum is 63.
The spelling of 13075998957 in words is "thirteen billion, seventy-five million, nine hundred ninety-eight thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •