Base | Representation |
---|---|
bin | 100110110001011110010… |
… | …010001100111101100001 |
3 | 100102201102220111010000221 |
4 | 212301132102030331201 |
5 | 322123304124203010 |
6 | 5400011534043041 |
7 | 363333561343303 |
oct | 46613622147541 |
9 | 10381386433027 |
10 | 2664461553505 |
11 | 937aa00a2644 |
12 | 370482949481 |
13 | 164347083b3b |
14 | 92d63d65973 |
15 | 494970e4dda |
hex | 26c5e48cf61 |
2664461553505 has 8 divisors (see below), whose sum is σ = 3200999654952. Its totient is φ = 2129138715648.
The previous prime is 2664461553449. The next prime is 2664461553511. The reversal of 2664461553505 is 5053551644662.
2664461553505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 952365195664 + 1712096357841 = 975892^2 + 1308471^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2664461553505 - 215 = 2664461520737 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 303811072 + ... + 303819841.
It is an arithmetic number, because the mean of its divisors is an integer number (400124956869).
Almost surely, 22664461553505 is an apocalyptic number.
It is an amenable number.
2664461553505 is a deficient number, since it is larger than the sum of its proper divisors (536538101447).
2664461553505 is an equidigital number, since it uses as much as digits as its factorization.
2664461553505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607631795.
The product of its (nonzero) digits is 12960000, while the sum is 52.
The spelling of 2664461553505 in words is "two trillion, six hundred sixty-four billion, four hundred sixty-one million, five hundred fifty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •