Base | Representation |
---|---|
bin | 101100001111111… |
… | …111101101100111 |
3 | 1220201221100111022 |
4 | 230033333231213 |
5 | 3010023000011 |
6 | 201400001355 |
7 | 24253134113 |
oct | 5417775547 |
9 | 1821840438 |
10 | 742390631 |
11 | 351073084 |
12 | 18876025b |
13 | baa620c8 |
14 | 70850743 |
15 | 452978db |
hex | 2c3ffb67 |
742390631 has 4 divisors (see below), whose sum is σ = 742462512. Its totient is φ = 742318752.
The previous prime is 742390613. The next prime is 742390639. The reversal of 742390631 is 136093247.
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 is a cyclic number.
It is not a de Polignac number, because 742390631 - 214 = 742374247 is a prime.
It is a super-3 number, since 3×7423906313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 742390591 and 742390600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (742390639) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17186 + ... + 42191.
It is an arithmetic number, because the mean of its divisors is an integer number (185615628).
Almost surely, 2742390631 is an apocalyptic number.
742390631 is a deficient number, since it is larger than the sum of its proper divisors (71881).
742390631 is a wasteful number, since it uses less digits than its factorization.
742390631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71880.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 742390631 is about 27246.8462578699. The cubic root of 742390631 is about 905.4771477336.
The spelling of 742390631 in words is "seven hundred forty-two million, three hundred ninety thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •