Base | Representation |
---|---|
bin | 111100101001… |
… | …0000011110101 |
3 | 2012211021100020 |
4 | 1321102003311 |
5 | 31114342042 |
6 | 3053235353 |
7 | 534145056 |
oct | 171220365 |
9 | 65737306 |
10 | 31793397 |
11 | 16a45939 |
12 | a792b59 |
13 | 678237c |
14 | 431872d |
15 | 2bd03ec |
hex | 1e520f5 |
31793397 has 8 divisors (see below), whose sum is σ = 43537056. Its totient is φ = 20622672.
The previous prime is 31793371. The next prime is 31793407. The reversal of 31793397 is 79339713.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31793397 - 28 = 31793141 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31793317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143103 + ... + 143324.
It is an arithmetic number, because the mean of its divisors is an integer number (5442132).
Almost surely, 231793397 is an apocalyptic number.
31793397 is a gapful number since it is divisible by the number (37) formed by its first and last digit.
It is an amenable number.
31793397 is a deficient number, since it is larger than the sum of its proper divisors (11743659).
31793397 is a wasteful number, since it uses less digits than its factorization.
31793397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286467.
The product of its digits is 107163, while the sum is 42.
The square root of 31793397 is about 5638.5633808622. The cubic root of 31793397 is about 316.7954808654.
The spelling of 31793397 in words is "thirty-one million, seven hundred ninety-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •