Base | Representation |
---|---|
bin | 100110110001000101000… |
… | …000010100010010111000 |
3 | 100102200100100102122012120 |
4 | 212301011000110102320 |
5 | 322121422040401202 |
6 | 5355501503441240 |
7 | 363320221366014 |
oct | 46610500242270 |
9 | 10380310378176 |
10 | 2664037434552 |
11 | 9378a275380a |
12 | 3703848b6220 |
13 | 1642aa249390 |
14 | 92d238c3544 |
15 | 4946ec6a0bc |
hex | 26c450144b8 |
2664037434552 has 128 divisors (see below), whose sum is σ = 7208678400000. Its totient is φ = 815561187840.
The previous prime is 2664037434529. The next prime is 2664037434589. The reversal of 2664037434552 is 2554347304662.
It is a junction number, because it is equal to n+sod(n) for n = 2664037434495 and 2664037434504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 378464649 + ... + 378471687.
It is an arithmetic number, because the mean of its divisors is an integer number (56317800000).
Almost surely, 22664037434552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2664037434552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3604339200000).
2664037434552 is an abundant number, since it is smaller than the sum of its proper divisors (4544640965448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2664037434552 is a wasteful number, since it uses less digits than its factorization.
2664037434552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13021 (or 13017 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 51.
The spelling of 2664037434552 in words is "two trillion, six hundred sixty-four billion, thirty-seven million, four hundred thirty-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •