Base | Representation |
---|---|
bin | 101011000010001100111… |
… | …110110010001100011101 |
3 | 101110201022111220011210110 |
4 | 223002030332302030131 |
5 | 341423024002042123 |
6 | 10142322141400233 |
7 | 423441501530250 |
oct | 53021476621435 |
9 | 11421274804713 |
10 | 2957302768413 |
11 | a40204352724 |
12 | 3b918a869079 |
13 | 185b45a23026 |
14 | a31c4417097 |
15 | 51dd6072493 |
hex | 2b08cfb231d |
2957302768413 has 32 divisors (see below), whose sum is σ = 4871747184640. Its totient is φ = 1557677044800.
The previous prime is 2957302768403. The next prime is 2957302768429. The reversal of 2957302768413 is 3148672037592.
2957302768413 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 2957302768413 - 26 = 2957302768349 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2957302768403) 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, 100144513 + ... + 100174038.
It is an arithmetic number, because the mean of its divisors is an integer number (152242099520).
It is a 1-persistent number, because it is pandigital, but 2⋅2957302768413 = 5914605536826 is not.
Almost surely, 22957302768413 is an apocalyptic number.
It is an amenable number.
2957302768413 is a deficient number, since it is larger than the sum of its proper divisors (1914444416227).
2957302768413 is a wasteful number, since it uses less digits than its factorization.
2957302768413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200318617.
The product of its (nonzero) digits is 15240960, while the sum is 57.
The spelling of 2957302768413 in words is "two trillion, nine hundred fifty-seven billion, three hundred two million, seven hundred sixty-eight thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •