Base | Representation |
---|---|
bin | 110000011111101111010… |
… | …1100011010101011001101 |
3 | 212121012010101000101122100 |
4 | 1200333132230122223031 |
5 | 1333200342444233040 |
6 | 22101544204305313 |
7 | 1255355424066210 |
oct | 140773654325315 |
9 | 25535111011570 |
10 | 6665230461645 |
11 | 213a787919288 |
12 | 8b7924242239 |
13 | 3946b42674b2 |
14 | 190855459777 |
15 | b85a0834b30 |
hex | 60fdeb1aacd |
6665230461645 has 48 divisors (see below), whose sum is σ = 13203831992832. Its totient is φ = 3046886841600.
The previous prime is 6665230461623. The next prime is 6665230461647. The reversal of 6665230461645 is 5461640325666.
It is not a de Polignac number, because 6665230461645 - 210 = 6665230460621 is a prime.
It is a super-3 number, since 3×66652304616453 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 6665230461591 and 6665230461600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6665230461647) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 13603849 + ... + 14085281.
It is an arithmetic number, because the mean of its divisors is an integer number (275079833184).
Almost surely, 26665230461645 is an apocalyptic number.
It is an amenable number.
6665230461645 is a deficient number, since it is larger than the sum of its proper divisors (6538601531187).
6665230461645 is a wasteful number, since it uses less digits than its factorization.
6665230461645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 525402 (or 525399 counting only the distinct ones).
The product of its (nonzero) digits is 18662400, while the sum is 54.
The spelling of 6665230461645 in words is "six trillion, six hundred sixty-five billion, two hundred thirty million, four hundred sixty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •