Base | Representation |
---|---|
bin | 101000110100000101011… |
… | …111011110001110111101 |
3 | 100221010102202202000110122 |
4 | 220310011133132032331 |
5 | 331423014134440134 |
6 | 5544244122344325 |
7 | 406430136532202 |
oct | 50640537361675 |
9 | 10833382660418 |
10 | 2804705780669 |
11 | 991518327211 |
12 | 3936a235b0a5 |
13 | 174637416a40 |
14 | 99a69ba9ca9 |
15 | 4ce544aa02e |
hex | 28d057de3bd |
2804705780669 has 16 divisors (see below), whose sum is σ = 3118327618560. Its totient is φ = 2505798815040.
The previous prime is 2804705780663. The next prime is 2804705780683. The reversal of 2804705780669 is 9660875074082.
It is a cyclic number.
It is not a de Polignac number, because 2804705780669 - 212 = 2804705776573 is a prime.
It is a super-2 number, since 2×28047057806692 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2804705780663) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15172499 + ... + 15356240.
It is an arithmetic number, because the mean of its divisors is an integer number (194895476160).
Almost surely, 22804705780669 is an apocalyptic number.
It is an amenable number.
2804705780669 is a deficient number, since it is larger than the sum of its proper divisors (313621837891).
2804705780669 is a wasteful number, since it uses less digits than its factorization.
2804705780669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30528980.
The product of its (nonzero) digits is 40642560, while the sum is 62.
The spelling of 2804705780669 in words is "two trillion, eight hundred four billion, seven hundred five million, seven hundred eighty thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •