Base | Representation |
---|---|
bin | 100111011000111110100… |
… | …001110010101001000011 |
3 | 100120202221000100022100000 |
4 | 213120332201302221003 |
5 | 323322141340121201 |
6 | 5431304531131043 |
7 | 366364654060350 |
oct | 47307641625103 |
9 | 10522830308300 |
10 | 2706878442051 |
11 | 953a87348833 |
12 | 378740143a83 |
13 | 168346a86164 |
14 | 9502950b627 |
15 | 4a62ad8bd86 |
hex | 2763e872a43 |
2706878442051 has 96 divisors (see below), whose sum is σ = 4794177024000. Its totient is φ = 1493544407040.
The previous prime is 2706878442043. The next prime is 2706878442053. The reversal of 2706878442051 is 1502448786072.
2706878442051 is a `hidden beast` number, since 2 + 70 + 6 + 87 + 8 + 442 + 0 + 51 = 666.
2706878442051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2706878442051 - 23 = 2706878442043 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2706878442053) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 23619055 + ... + 23733383.
It is an arithmetic number, because the mean of its divisors is an integer number (49939344000).
Almost surely, 22706878442051 is an apocalyptic number.
2706878442051 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2706878442051 is a deficient number, since it is larger than the sum of its proper divisors (2087298581949).
2706878442051 is a wasteful number, since it uses less digits than its factorization.
2706878442051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114831 (or 114819 counting only the distinct ones).
The product of its (nonzero) digits is 6021120, while the sum is 54.
The spelling of 2706878442051 in words is "two trillion, seven hundred six billion, eight hundred seventy-eight million, four hundred forty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •