Base | Representation |
---|---|
bin | 100111110000111001… |
… | …000011000110001101 |
3 | 11002012120102022011011 |
4 | 213300321003012031 |
5 | 1144420211124042 |
6 | 31340411325221 |
7 | 3041023435015 |
oct | 476071030615 |
9 | 132176368134 |
10 | 42696192397 |
11 | 1711a984321 |
12 | 8336a50811 |
13 | 4045834b91 |
14 | 20d06ccc45 |
15 | 119d568a17 |
hex | 9f0e4318d |
42696192397 has 4 divisors (see below), whose sum is σ = 42696629820. Its totient is φ = 42695754976.
The previous prime is 42696192373. The next prime is 42696192403. The reversal of 42696192397 is 79329169624.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 33955064361 + 8741128036 = 184269^2 + 93494^2 .
It is a cyclic number.
It is not a de Polignac number, because 42696192397 - 231 = 40548708749 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 (42696192797) 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, 1833 + ... + 292225.
It is an arithmetic number, because the mean of its divisors is an integer number (10674157455).
Almost surely, 242696192397 is an apocalyptic number.
It is an amenable number.
42696192397 is a deficient number, since it is larger than the sum of its proper divisors (437423).
42696192397 is a wasteful number, since it uses less digits than its factorization.
42696192397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 437422.
The product of its digits is 8817984, while the sum is 58.
The spelling of 42696192397 in words is "forty-two billion, six hundred ninety-six million, one hundred ninety-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •