Base | Representation |
---|---|
bin | 101001011011011… |
… | …100101000010101 |
3 | 1210102212202110111 |
4 | 221123130220111 |
5 | 2410413423023 |
6 | 152545323021 |
7 | 23136630643 |
oct | 5133345025 |
9 | 1712782414 |
10 | 695061013 |
11 | 327386699 |
12 | 174936471 |
13 | b100030a |
14 | 68450193 |
15 | 4104900d |
hex | 296dca15 |
695061013 has 8 divisors (see below), whose sum is σ = 718639616. Its totient is φ = 671554800.
The previous prime is 695061001. The next prime is 695061019. The reversal of 695061013 is 310160596.
695061013 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 695061013 - 225 = 661506581 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (695061019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1795 + ... + 37327.
It is an arithmetic number, because the mean of its divisors is an integer number (89829952).
Almost surely, 2695061013 is an apocalyptic number.
It is an amenable number.
695061013 is a deficient number, since it is larger than the sum of its proper divisors (23578603).
695061013 is a wasteful number, since it uses less digits than its factorization.
695061013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36195.
The product of its (nonzero) digits is 4860, while the sum is 31.
The square root of 695061013 is about 26364.0098050353. The cubic root of 695061013 is about 885.8108108705.
The spelling of 695061013 in words is "six hundred ninety-five million, sixty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •