Base | Representation |
---|---|
bin | 11000011001001001… |
… | …11010011001101011 |
3 | 1020210200020220012220 |
4 | 30030210322121223 |
5 | 203310022424000 |
6 | 10003254405123 |
7 | 642346232454 |
oct | 141444723153 |
9 | 36720226186 |
10 | 13095904875 |
11 | 561032a189 |
12 | 26559607a3 |
13 | 1309210551 |
14 | 8c33b212b |
15 | 519a981a0 |
hex | 30c93a66b |
13095904875 has 32 divisors (see below), whose sum is σ = 22380571200. Its totient is φ = 6795705600.
The previous prime is 13095904873. The next prime is 13095904891. The reversal of 13095904875 is 57840959031.
13095904875 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13095904875 - 21 = 13095904873 is a prime.
It is a super-3 number, since 3×130959048753 (a number of 31 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13095904873) 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 31 ways as a sum of consecutive naturals, for example, 458050 + ... + 485799.
It is an arithmetic number, because the mean of its divisors is an integer number (699392850).
Almost surely, 213095904875 is an apocalyptic number.
13095904875 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13095904875 is a deficient number, since it is larger than the sum of its proper divisors (9284666325).
13095904875 is an equidigital number, since it uses as much as digits as its factorization.
13095904875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 943904 (or 943894 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 13095904875 in words is "thirteen billion, ninety-five million, nine hundred four thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •