Base | Representation |
---|---|
bin | 1001111001000001… |
… | …1010110101010101 |
3 | 20212001001021102211 |
4 | 2132100122311111 |
5 | 20414201314331 |
6 | 1115244033421 |
7 | 122540004661 |
oct | 23620326525 |
9 | 6761037384 |
10 | 2655104341 |
11 | 114281220a |
12 | 621232871 |
13 | 3340c7776 |
14 | 1b28a78a1 |
15 | 1081678b1 |
hex | 9e41ad55 |
2655104341 has 6 divisors (see below), whose sum is σ = 2695328790. Its totient is φ = 2615471496.
The previous prime is 2655104323. The next prime is 2655104393. The reversal of 2655104341 is 1434015562.
It is a happy number.
2655104341 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 only one way, i.e., 1417823716 + 1237280625 = 37654^2 + 35175^2 .
It is not a de Polignac number, because 2655104341 - 211 = 2655102293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2655104311) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 291246 + ... + 300223.
It is an arithmetic number, because the mean of its divisors is an integer number (449221465).
Almost surely, 22655104341 is an apocalyptic number.
It is an amenable number.
2655104341 is a deficient number, since it is larger than the sum of its proper divisors (40224449).
2655104341 is an frugal number, since it uses more digits than its factorization.
2655104341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 591603 (or 591536 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 2655104341 is about 51527.7045966536. The cubic root of 2655104341 is about 1384.7154278123.
The spelling of 2655104341 in words is "two billion, six hundred fifty-five million, one hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •