Base | Representation |
---|---|
bin | 101001101110011111111… |
… | …111110001100111011001 |
3 | 101011010022221200120122120 |
4 | 221232133333301213121 |
5 | 333434442413411243 |
6 | 10033140014211453 |
7 | 414110345306340 |
oct | 51563777614731 |
9 | 11133287616576 |
10 | 2867427482073 |
11 | a06084072880 |
12 | 3a38877b3b89 |
13 | 17a5219b831b |
14 | 9cad9d00b57 |
15 | 4e8c5b2cc83 |
hex | 29b9fff19d9 |
2867427482073 has 32 divisors (see below), whose sum is σ = 4790585702400. Its totient is φ = 1482087404160.
The previous prime is 2867427482069. The next prime is 2867427482099. The reversal of 2867427482073 is 3702847247682.
2867427482073 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2867427482073 - 22 = 2867427482069 is a prime.
It is a super-3 number, since 3×28674274820733 (a number of 38 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2867427481998 and 2867427482016.
It is not an unprimeable number, because it can be changed into a prime (2867427482173) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31142740 + ... + 31234677.
It is an arithmetic number, because the mean of its divisors is an integer number (149705803200).
Almost surely, 22867427482073 is an apocalyptic number.
It is an amenable number.
2867427482073 is a deficient number, since it is larger than the sum of its proper divisors (1923158220327).
2867427482073 is a wasteful number, since it uses less digits than its factorization.
2867427482073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62377637.
The product of its (nonzero) digits is 50577408, while the sum is 60.
The spelling of 2867427482073 in words is "two trillion, eight hundred sixty-seven billion, four hundred twenty-seven million, four hundred eighty-two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •