Base | Representation |
---|---|
bin | 10010101110111010… |
… | …01100010010000111 |
3 | 221221220101221110022 |
4 | 21113131030102013 |
5 | 131044121023441 |
6 | 4341544445355 |
7 | 504140555000 |
oct | 112735142207 |
9 | 27856357408 |
10 | 10057204871 |
11 | 42a103696a |
12 | 1b4817985b |
13 | c437c90cc |
14 | 6b59b41a7 |
15 | 3dce0c84b |
hex | 25774c487 |
10057204871 has 32 divisors (see below), whose sum is σ = 12439680000. Its totient is φ = 8110095840.
The previous prime is 10057204837. The next prime is 10057204877. The reversal of 10057204871 is 17840275001.
10057204871 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 10057204871 - 222 = 10053010567 is a prime.
It is a super-2 number, since 2×100572048712 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10057204877) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 470780 + ... + 491678.
It is an arithmetic number, because the mean of its divisors is an integer number (388740000).
Almost surely, 210057204871 is an apocalyptic number.
10057204871 is a deficient number, since it is larger than the sum of its proper divisors (2382475129).
10057204871 is an equidigital number, since it uses as much as digits as its factorization.
10057204871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21004 (or 20990 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 35.
Adding to 10057204871 its reverse (17840275001), we get a palindrome (27897479872).
The spelling of 10057204871 in words is "ten billion, fifty-seven million, two hundred four thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •