Base | Representation |
---|---|
bin | 100110110001000101101… |
… | …111111001001110010101 |
3 | 100102200101012220021121120 |
4 | 212301011233321032111 |
5 | 322121433234002311 |
6 | 5355503031034153 |
7 | 363320432402430 |
oct | 46610557711625 |
9 | 10380335807546 |
10 | 2664049906581 |
11 | 9378a97a2178 |
12 | 370388b0b959 |
13 | 1642ac9c518b |
14 | 92d2540c817 |
15 | 49470dd0706 |
hex | 26c45bf9395 |
2664049906581 has 32 divisors (see below), whose sum is σ = 4137121578240. Its totient is φ = 1493222075904.
The previous prime is 2664049906571. The next prime is 2664049906589. The reversal of 2664049906581 is 1856099404662.
It is not a de Polignac number, because 2664049906581 - 26 = 2664049906517 is a prime.
It is a super-2 number, since 2×26640499065812 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2664049906589) 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 31 ways as a sum of consecutive naturals, for example, 4239415 + ... + 4827083.
It is an arithmetic number, because the mean of its divisors is an integer number (129285049320).
Almost surely, 22664049906581 is an apocalyptic number.
2664049906581 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2664049906581 is a deficient number, since it is larger than the sum of its proper divisors (1473071671659).
2664049906581 is a wasteful number, since it uses less digits than its factorization.
2664049906581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591805.
The product of its (nonzero) digits is 22394880, while the sum is 60.
The spelling of 2664049906581 in words is "two trillion, six hundred sixty-four billion, forty-nine million, nine hundred six thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •