Base | Representation |
---|---|
bin | 11001011000010010… |
… | …00001111011110101 |
3 | 1022011120201102100121 |
4 | 30230021001323311 |
5 | 210401104412423 |
6 | 10132013011541 |
7 | 661436361313 |
oct | 145411017365 |
9 | 38146642317 |
10 | 13625466613 |
11 | 5862247810 |
12 | 2783183bb1 |
13 | 1391b45ca5 |
14 | 9338610b3 |
15 | 54b30045d |
hex | 32c241ef5 |
13625466613 has 8 divisors (see below), whose sum is σ = 14865444576. Its totient is φ = 12385705200.
The previous prime is 13625466587. The next prime is 13625466643. The reversal of 13625466613 is 31666452631.
13625466613 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 de Polignac number, because none of the positive numbers 2k-13625466613 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13625466613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13625466643) 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, 95403 + ... + 190663.
It is an arithmetic number, because the mean of its divisors is an integer number (1858180572).
Almost surely, 213625466613 is an apocalyptic number.
It is an amenable number.
13625466613 is a deficient number, since it is larger than the sum of its proper divisors (1239977963).
13625466613 is a wasteful number, since it uses less digits than its factorization.
13625466613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108275.
The product of its digits is 466560, while the sum is 43.
The spelling of 13625466613 in words is "thirteen billion, six hundred twenty-five million, four hundred sixty-six thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •