Base | Representation |
---|---|
bin | 10011101110101010… |
… | …10001000110111101 |
3 | 1000100011201021020221 |
4 | 21313111101012331 |
5 | 133143022422042 |
6 | 4511011141341 |
7 | 523323333541 |
oct | 116725210675 |
9 | 30304637227 |
10 | 10591998397 |
11 | 45459a8192 |
12 | 20772a4851 |
13 | cca543c96 |
14 | 726a25a21 |
15 | 41ed49d67 |
hex | 2775511bd |
10591998397 has 4 divisors (see below), whose sum is σ = 10592216316. Its totient is φ = 10591780480.
The previous prime is 10591998331. The next prime is 10591998413. The reversal of 10591998397 is 79389919501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1408801156 + 9183197241 = 37534^2 + 95829^2 .
It is a cyclic number.
It is not a de Polignac number, because 10591998397 - 27 = 10591998269 is a prime.
It is a super-2 number, since 2×105919983972 (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 (10591998317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 813 + ... + 145549.
It is an arithmetic number, because the mean of its divisors is an integer number (2648054079).
Almost surely, 210591998397 is an apocalyptic number.
It is an amenable number.
10591998397 is a deficient number, since it is larger than the sum of its proper divisors (217919).
10591998397 is an equidigital number, since it uses as much as digits as its factorization.
10591998397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217918.
The product of its (nonzero) digits is 5511240, while the sum is 61.
The spelling of 10591998397 in words is "ten billion, five hundred ninety-one million, nine hundred ninety-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •