Base | Representation |
---|---|
bin | 11000101011000101… |
… | …01001001011110101 |
3 | 1021012011021000102101 |
4 | 30111202221023311 |
5 | 204112023230023 |
6 | 10030230142101 |
7 | 646153510024 |
oct | 142542511365 |
9 | 37164230371 |
10 | 13246305013 |
11 | 5688215017 |
12 | 26981b1931 |
13 | 133141c606 |
14 | 8d93628bb |
15 | 527da61ad |
hex | 3158a92f5 |
13246305013 has 8 divisors (see below), whose sum is σ = 13423328000. Its totient is φ = 13069515888.
The previous prime is 13246304983. The next prime is 13246305049. The reversal of 13246305013 is 31050364231.
13246305013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13246305013 - 213 = 13246296821 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 (13246305073) 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 7 ways as a sum of consecutive naturals, for example, 57088 + ... + 172486.
It is an arithmetic number, because the mean of its divisors is an integer number (1677916000).
Almost surely, 213246305013 is an apocalyptic number.
It is an amenable number.
13246305013 is a deficient number, since it is larger than the sum of its proper divisors (177022987).
13246305013 is a wasteful number, since it uses less digits than its factorization.
13246305013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116931.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 13246305013 its reverse (31050364231), we get a palindrome (44296669244).
The spelling of 13246305013 in words is "thirteen billion, two hundred forty-six million, three hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •