Base | Representation |
---|---|
bin | 10100000011110110… |
… | …01101000011100111 |
3 | 1000210120010020012022 |
4 | 22001323031003213 |
5 | 134024021343211 |
6 | 4540400213355 |
7 | 530612033156 |
oct | 120173150347 |
9 | 30716106168 |
10 | 10769715431 |
11 | 4627250672 |
12 | 210690a25b |
13 | 10282c89a7 |
14 | 74248759d |
15 | 430751bdb |
hex | 281ecd0e7 |
10769715431 has 8 divisors (see below), whose sum is σ = 11239016064. Its totient is φ = 10300502520.
The previous prime is 10769715421. The next prime is 10769715479. The reversal of 10769715431 is 13451796701.
10769715431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10769715431 - 26 = 10769715367 is a prime.
It is a super-2 number, since 2×107697154312 (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 (10769715401) 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 7 ways as a sum of consecutive naturals, for example, 411116 + ... + 436526.
It is an arithmetic number, because the mean of its divisors is an integer number (1404877008).
Almost surely, 210769715431 is an apocalyptic number.
10769715431 is a deficient number, since it is larger than the sum of its proper divisors (469300633).
10769715431 is a wasteful number, since it uses less digits than its factorization.
10769715431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43861.
The product of its (nonzero) digits is 158760, while the sum is 44.
The spelling of 10769715431 in words is "ten billion, seven hundred sixty-nine million, seven hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •