Base | Representation |
---|---|
bin | 11000011001100100… |
… | …10110001110100111 |
3 | 1020210220212211021212 |
4 | 30030302112032213 |
5 | 203311423123402 |
6 | 10003502102035 |
7 | 642421201322 |
oct | 141462261647 |
9 | 36726784255 |
10 | 13099426727 |
11 | 5612315202 |
12 | 2656b7a91b |
13 | 1309b7459a |
14 | 8c3a4b7b9 |
15 | 51a041952 |
hex | 30cc963a7 |
13099426727 has 4 divisors (see below), whose sum is σ = 13177866576. Its totient is φ = 13020986880.
The previous prime is 13099426699. The next prime is 13099426771. The reversal of 13099426727 is 72762499031.
13099426727 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72762499031 = 193 ⋅377007767.
It is a cyclic number.
It is not a de Polignac number, because 13099426727 - 220 = 13098378151 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13099426027) 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 3 ways as a sum of consecutive naturals, for example, 39219674 + ... + 39220007.
It is an arithmetic number, because the mean of its divisors is an integer number (3294466644).
Almost surely, 213099426727 is an apocalyptic number.
13099426727 is a deficient number, since it is larger than the sum of its proper divisors (78439849).
13099426727 is an equidigital number, since it uses as much as digits as its factorization.
13099426727 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78439848.
The product of its (nonzero) digits is 1143072, while the sum is 50.
The spelling of 13099426727 in words is "thirteen billion, ninety-nine million, four hundred twenty-six thousand, seven hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •