Base | Representation |
---|---|
bin | 10011100011000110010… |
… | …01000001000010010010 |
3 | 2101012201102001012100020 |
4 | 21301203021001002102 |
5 | 42001044110043343 |
6 | 1232321551004310 |
7 | 66345545356554 |
oct | 11614311010222 |
9 | 2335642035306 |
10 | 671678206098 |
11 | 239947922759 |
12 | aa213809696 |
13 | 4b453990603 |
14 | 2471bb0b4d4 |
15 | 12712979b83 |
hex | 9c63241092 |
671678206098 has 8 divisors (see below), whose sum is σ = 1343356412208. Its totient is φ = 223892735364.
The previous prime is 671678206091. The next prime is 671678206099. The reversal of 671678206098 is 890602876176.
It is a sphenic number, since it is the product of 3 distinct primes.
671678206098 is an admirable number.
It is a super-2 number, since 2×6716782060982 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (671678206091) 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, 55973183836 + ... + 55973183847.
It is an arithmetic number, because the mean of its divisors is an integer number (167919551526).
Almost surely, 2671678206098 is an apocalyptic number.
671678206098 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
671678206098 is a wasteful number, since it uses less digits than its factorization.
671678206098 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111946367688.
The product of its (nonzero) digits is 12192768, while the sum is 60.
The spelling of 671678206098 in words is "six hundred seventy-one billion, six hundred seventy-eight million, two hundred six thousand, ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •