Base | Representation |
---|---|
bin | 101101100110001100111… |
… | …0101000000010010100001 |
3 | 211012002200102010202221221 |
4 | 1123030121311000102201 |
5 | 1310133341344010311 |
6 | 21154531315415041 |
7 | 1214521625166001 |
oct | 133143165002241 |
9 | 24162612122857 |
10 | 6266790610081 |
11 | 1aa6804a19561 |
12 | 8526675b4481 |
13 | 365c56c1ab11 |
14 | 179458576001 |
15 | ad030db7671 |
hex | 5b319d404a1 |
6266790610081 has 4 divisors (see below), whose sum is σ = 6266827476612. Its totient is φ = 6266753743552.
The previous prime is 6266790610043. The next prime is 6266790610121. The reversal of 6266790610081 is 1800160976626.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2798647943056 + 3468142667025 = 1672916^2 + 1862295^2 .
It is a cyclic number.
It is not a de Polignac number, because 6266790610081 - 217 = 6266790479009 is a prime.
It is a super-2 number, since 2×62667906100812 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6266790610001) 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, 18177100 + ... + 18518653.
It is an arithmetic number, because the mean of its divisors is an integer number (1566706869153).
Almost surely, 26266790610081 is an apocalyptic number.
It is an amenable number.
6266790610081 is a deficient number, since it is larger than the sum of its proper divisors (36866531).
6266790610081 is a wasteful number, since it uses less digits than its factorization.
6266790610081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36866530.
The product of its (nonzero) digits is 1306368, while the sum is 52.
The spelling of 6266790610081 in words is "six trillion, two hundred sixty-six billion, seven hundred ninety million, six hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •