Base | Representation |
---|---|
bin | 10100001010111111… |
… | …00010110001000111 |
3 | 1000221201202022121101 |
4 | 22011133202301013 |
5 | 134134332320231 |
6 | 4550335200531 |
7 | 532236565453 |
oct | 120537426107 |
9 | 30851668541 |
10 | 10829573191 |
11 | 4658014698 |
12 | 2122976147 |
13 | 1037825c98 |
14 | 74a3c9663 |
15 | 435b27661 |
hex | 2857e2c47 |
10829573191 has 4 divisors (see below), whose sum is σ = 10831602384. Its totient is φ = 10827544000.
The previous prime is 10829573149. The next prime is 10829573219. The reversal of 10829573191 is 19137592801.
10829573191 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 19137592801 = 17 ⋅1125740753.
It is a cyclic number.
It is not a de Polignac number, because 10829573191 - 219 = 10829048903 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10829577191) 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 3 ways as a sum of consecutive naturals, for example, 1006570 + ... + 1017271.
It is an arithmetic number, because the mean of its divisors is an integer number (2707900596).
Almost surely, 210829573191 is an apocalyptic number.
10829573191 is a deficient number, since it is larger than the sum of its proper divisors (2029193).
10829573191 is an equidigital number, since it uses as much as digits as its factorization.
10829573191 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2029192.
The product of its (nonzero) digits is 136080, while the sum is 46.
The spelling of 10829573191 in words is "ten billion, eight hundred twenty-nine million, five hundred seventy-three thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •