Base | Representation |
---|---|
bin | 10100010111010100… |
… | …10011010001001111 |
3 | 1001012221110211010220 |
4 | 22023222103101033 |
5 | 134342330302331 |
6 | 5004513202423 |
7 | 534634306362 |
oct | 121352232117 |
9 | 31187424126 |
10 | 10933056591 |
11 | 4700475266 |
12 | 2151560413 |
13 | 10530b9172 |
14 | 75a0460d9 |
15 | 43ec69296 |
hex | 28ba9344f |
10933056591 has 4 divisors (see below), whose sum is σ = 14577408792. Its totient is φ = 7288704392.
The previous prime is 10933056587. The next prime is 10933056599. The reversal of 10933056591 is 19565033901.
10933056591 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.
It is a cyclic number.
It is not a de Polignac number, because 10933056591 - 22 = 10933056587 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10933056599) 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, 1822176096 + ... + 1822176101.
It is an arithmetic number, because the mean of its divisors is an integer number (3644352198).
Almost surely, 210933056591 is an apocalyptic number.
10933056591 is a deficient number, since it is larger than the sum of its proper divisors (3644352201).
10933056591 is an equidigital number, since it uses as much as digits as its factorization.
10933056591 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3644352200.
The product of its (nonzero) digits is 109350, while the sum is 42.
The spelling of 10933056591 in words is "ten billion, nine hundred thirty-three million, fifty-six thousand, five hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •