Base | Representation |
---|---|
bin | 100110110011000000110… |
… | …010100110110000111111 |
3 | 100102212201002021000101000 |
4 | 212303000302212300333 |
5 | 322140200214334400 |
6 | 5400443532221343 |
7 | 363422536624311 |
oct | 46630062466077 |
9 | 10385632230330 |
10 | 2666114214975 |
11 | 938768a72672 |
12 | 37086430a853 |
13 | 16454b597533 |
14 | 9307d6477b1 |
15 | 49542247600 |
hex | 26cc0ca6c3f |
2666114214975 has 192 divisors, whose sum is σ = 5118697382400. Its totient is φ = 1359338112000.
The previous prime is 2666114214947. The next prime is 2666114214977. The reversal of 2666114214975 is 5794124116662.
2666114214975 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 16328242-1.
It is a de Polignac number, because none of the positive numbers 2k-2666114214975 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2666114214977) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 540462609 + ... + 540467541.
It is an arithmetic number, because the mean of its divisors is an integer number (26659882200).
Almost surely, 22666114214975 is an apocalyptic number.
2666114214975 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2666114214975 is a deficient number, since it is larger than the sum of its proper divisors (2452583167425).
2666114214975 is a wasteful number, since it uses less digits than its factorization.
2666114214975 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383 (or 5372 counting only the distinct ones).
The product of its digits is 4354560, while the sum is 54.
The spelling of 2666114214975 in words is "two trillion, six hundred sixty-six billion, one hundred fourteen million, two hundred fourteen thousand, nine hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •