Base | Representation |
---|---|
bin | 1011010100000010… |
… | …10011111100111101 |
3 | 120200021201201122222 |
4 | 11222001103330331 |
5 | 44414331233221 |
6 | 2442404215125 |
7 | 303340364456 |
oct | 55201237475 |
9 | 16607651588 |
10 | 6073696061 |
11 | 2637496824 |
12 | 121609a4a5 |
13 | 75a42c9c4 |
14 | 41891412d |
15 | 2583439ab |
hex | 16a053f3d |
6073696061 has 4 divisors (see below), whose sum is σ = 6073852512. Its totient is φ = 6073539612.
The previous prime is 6073696021. The next prime is 6073696087. The reversal of 6073696061 is 1606963706.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1606963706 = 2 ⋅803481853.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6073696061 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 (6073696001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29000 + ... + 113966.
It is an arithmetic number, because the mean of its divisors is an integer number (1518463128).
Almost surely, 26073696061 is an apocalyptic number.
It is an amenable number.
6073696061 is a deficient number, since it is larger than the sum of its proper divisors (156451).
6073696061 is an equidigital number, since it uses as much as digits as its factorization.
6073696061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156450.
The product of its (nonzero) digits is 244944, while the sum is 44.
The square root of 6073696061 is about 77933.9211191122. The cubic root of 6073696061 is about 1824.5300408468.
The spelling of 6073696061 in words is "six billion, seventy-three million, six hundred ninety-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •