Base | Representation |
---|---|
bin | 101000001110001011101… |
… | …001101100101000001000 |
3 | 100210020101101200110000000 |
4 | 220032023221230220020 |
5 | 330241141233410143 |
6 | 5513433421043000 |
7 | 403456445205462 |
oct | 50161351545010 |
9 | 10706341613000 |
10 | 2764006935048 |
11 | 976232948107 |
12 | 3878243b6460 |
13 | 17084c63a678 |
14 | 97ac8885132 |
15 | 4bd7147cbd3 |
hex | 2838ba6ca08 |
2764006935048 has 64 divisors (see below), whose sum is σ = 7772584708800. Its totient is φ = 921335639184.
The previous prime is 2764006935031. The next prime is 2764006935073. The reversal of 2764006935048 is 8405396004672.
2764006935048 is a `hidden beast` number, since 2 + 7 + 6 + 40 + 0 + 6 + 93 + 504 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 2764006934985 and 2764006935003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78972186 + ... + 79007177.
It is an arithmetic number, because the mean of its divisors is an integer number (121446636075).
Almost surely, 22764006935048 is an apocalyptic number.
It is an amenable number.
2764006935048 is an abundant number, since it is smaller than the sum of its proper divisors (5008577773752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2764006935048 is an equidigital number, since it uses as much as digits as its factorization.
2764006935048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157979390 (or 157979368 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 54.
The spelling of 2764006935048 in words is "two trillion, seven hundred sixty-four billion, six million, nine hundred thirty-five thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •