Base | Representation |
---|---|
bin | 100110110011001101110… |
… | …110011001010101001011 |
3 | 100102220021100112022102220 |
4 | 212303031312121111023 |
5 | 322141122311443311 |
6 | 5400521400225123 |
7 | 363431140131153 |
oct | 46631566312513 |
9 | 10386240468386 |
10 | 2666333312331 |
11 | 938870709767 |
12 | 37090576b1a3 |
13 | 164584aaa140 |
14 | 930a079b763 |
15 | 495565c5206 |
hex | 26ccdd9954b |
2666333312331 has 8 divisors (see below), whose sum is σ = 3828581166480. Its totient is φ = 1640820499872.
The previous prime is 2666333312297. The next prime is 2666333312359. The reversal of 2666333312331 is 1332133336662.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2666333312331 - 210 = 2666333311307 is a prime.
It is a super-2 number, since 2×26663333123312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2666333312381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34183760376 + ... + 34183760453.
It is an arithmetic number, because the mean of its divisors is an integer number (478572645810).
Almost surely, 22666333312331 is an apocalyptic number.
2666333312331 is a deficient number, since it is larger than the sum of its proper divisors (1162247854149).
2666333312331 is a wasteful number, since it uses less digits than its factorization.
2666333312331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68367520845.
The product of its digits is 629856, while the sum is 42.
Adding to 2666333312331 its reverse (1332133336662), we get a palindrome (3998466648993).
The spelling of 2666333312331 in words is "two trillion, six hundred sixty-six billion, three hundred thirty-three million, three hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •