Base | Representation |
---|---|
bin | 1011011100000100… |
… | …0001001111110101 |
3 | 21220222200110010001 |
4 | 2313001001033311 |
5 | 22242021412111 |
6 | 1224403231301 |
7 | 136042541401 |
oct | 26701011765 |
9 | 7828613101 |
10 | 3070497781 |
11 | 133624147a |
12 | 718378531 |
13 | 39c1987c0 |
14 | 211b18101 |
15 | 12e86c1c1 |
hex | b70413f5 |
3070497781 has 8 divisors (see below), whose sum is σ = 3307175424. Its totient is φ = 2833889520.
The previous prime is 3070497743. The next prime is 3070497791. The reversal of 3070497781 is 1877940703.
3070497781 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 3070497781 - 211 = 3070495733 is a prime.
It is a super-2 number, since 2×30704977812 = 18855913246251847922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3070497701) 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, 108360 + ... + 133726.
It is an arithmetic number, because the mean of its divisors is an integer number (413396928).
Almost surely, 23070497781 is an apocalyptic number.
It is an amenable number.
3070497781 is a deficient number, since it is larger than the sum of its proper divisors (236677643).
3070497781 is a wasteful number, since it uses less digits than its factorization.
3070497781 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34691.
The product of its (nonzero) digits is 296352, while the sum is 46.
The square root of 3070497781 is about 55412.0725203452. The cubic root of 3070497781 is about 1453.4594813710.
The spelling of 3070497781 in words is "three billion, seventy million, four hundred ninety-seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •