Base | Representation |
---|---|
bin | 101011000000100111010… |
… | …000001010001011011111 |
3 | 101110112220120101202020220 |
4 | 223000213100022023133 |
5 | 341411030042001241 |
6 | 10141440532412423 |
7 | 423351265612263 |
oct | 53004720121337 |
9 | 11415816352226 |
10 | 2955596047071 |
11 | a3a508a09718 |
12 | 3b8993177113 |
13 | 185933262345 |
14 | a30a18a20a3 |
15 | 51d362e2166 |
hex | 2b02740a2df |
2955596047071 has 16 divisors (see below), whose sum is σ = 3944886067200. Its totient is φ = 1968352737120.
The previous prime is 2955596047049. The next prime is 2955596047111. The reversal of 2955596047071 is 1707406955592.
It is a happy number.
2955596047071 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 2955596047071 - 211 = 2955596045023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2955596046996 and 2955596047014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2955596047031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11401405 + ... + 11657753.
It is an arithmetic number, because the mean of its divisors is an integer number (246555379200).
Almost surely, 22955596047071 is an apocalyptic number.
2955596047071 is a deficient number, since it is larger than the sum of its proper divisors (989290020129).
2955596047071 is a wasteful number, since it uses less digits than its factorization.
2955596047071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260326.
The product of its (nonzero) digits is 23814000, while the sum is 60.
The spelling of 2955596047071 in words is "two trillion, nine hundred fifty-five billion, five hundred ninety-six million, forty-seven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •