Base | Representation |
---|---|
bin | 110001100000000000101… |
… | …0000101010011100010011 |
3 | 220002101101010212222110021 |
4 | 1203000001100222130103 |
5 | 1342431023312422402 |
6 | 22245211500044311 |
7 | 1301342601161152 |
oct | 143000120523423 |
9 | 26071333788407 |
10 | 6803249342227 |
11 | 2193272991048 |
12 | 91a622533697 |
13 | 3a470b562b80 |
14 | 1973c9905599 |
15 | bbe7c672d37 |
hex | 6300142a713 |
6803249342227 has 4 divisors (see below), whose sum is σ = 7326576214720. Its totient is φ = 6279922469736.
The previous prime is 6803249342221. The next prime is 6803249342317. The reversal of 6803249342227 is 7222439423086.
6803249342227 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 6803249342227 - 227 = 6803115124499 is a prime.
It is a super-2 number, since 2×68032493422272 (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 (6803249342221) 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, 261663436227 + ... + 261663436252.
It is an arithmetic number, because the mean of its divisors is an integer number (1831644053680).
Almost surely, 26803249342227 is an apocalyptic number.
6803249342227 is a deficient number, since it is larger than the sum of its proper divisors (523326872493).
6803249342227 is a wasteful number, since it uses less digits than its factorization.
6803249342227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523326872492.
The product of its (nonzero) digits is 6967296, while the sum is 52.
The spelling of 6803249342227 in words is "six trillion, eight hundred three billion, two hundred forty-nine million, three hundred forty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •