Base | Representation |
---|---|
bin | 100110110010001110001… |
… | …111111011100001001011 |
3 | 100102210111222200122111111 |
4 | 212302032033323201023 |
5 | 322131431130423024 |
6 | 5400223441511151 |
7 | 363362532306403 |
oct | 46621617734113 |
9 | 10383458618444 |
10 | 2665266264139 |
11 | 938373360656 |
12 | 3706683424b7 |
13 | 1644449c5b8b |
14 | 92ddcb99803 |
15 | 494e2a9ca94 |
hex | 26c8e3fb84b |
2665266264139 has 4 divisors (see below), whose sum is σ = 2665269904024. Its totient is φ = 2665262624256.
The previous prime is 2665266263993. The next prime is 2665266264169. The reversal of 2665266264139 is 9314626625662.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2665266264139 - 241 = 466243008587 is a prime.
It is a super-2 number, since 2×26652662641392 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2665266264169) 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 3 ways as a sum of consecutive naturals, for example, 296502 + ... + 2327755.
It is an arithmetic number, because the mean of its divisors is an integer number (666317476006).
Almost surely, 22665266264139 is an apocalyptic number.
2665266264139 is a deficient number, since it is larger than the sum of its proper divisors (3639885).
2665266264139 is a wasteful number, since it uses less digits than its factorization.
2665266264139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3639884.
The product of its digits is 33592320, while the sum is 58.
The spelling of 2665266264139 in words is "two trillion, six hundred sixty-five billion, two hundred sixty-six million, two hundred sixty-four thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •