Base | Representation |
---|---|
bin | 10011011100010011000… |
… | …11111110000000000001 |
3 | 2100212022000020022100000 |
4 | 21232021203332000001 |
5 | 41421110111312330 |
6 | 1230515430550213 |
7 | 66156231636411 |
oct | 11561143760001 |
9 | 2325260208300 |
10 | 668027838465 |
11 | 2383443324a9 |
12 | a9575208369 |
13 | 4acc1626970 |
14 | 24492daa641 |
15 | 1259c269560 |
hex | 9b898fe001 |
668027838465 has 96 divisors (see below), whose sum is σ = 1328121639936. Its totient is φ = 319986443520.
The previous prime is 668027838437. The next prime is 668027838529. The reversal of 668027838465 is 564838720866.
668027838465 is a `hidden beast` number, since 66 + 80 + 2 + 7 + 8 + 38 + 465 = 666.
It is not a de Polignac number, because 668027838465 - 27 = 668027838337 is a prime.
It is a super-2 number, since 2×6680278384652 (a number of 24 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 12880 + ... + 1155950.
It is an arithmetic number, because the mean of its divisors is an integer number (13834600416).
Almost surely, 2668027838465 is an apocalyptic number.
668027838465 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
668027838465 is a deficient number, since it is larger than the sum of its proper divisors (660093801471).
668027838465 is a wasteful number, since it uses less digits than its factorization.
668027838465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1143141 (or 1143129 counting only the distinct ones).
The product of its (nonzero) digits is 92897280, while the sum is 63.
The spelling of 668027838465 in words is "six hundred sixty-eight billion, twenty-seven million, eight hundred thirty-eight thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •