Base | Representation |
---|---|
bin | 101001001011100… |
… | …011010101000001 |
3 | 1210011001001121001 |
4 | 221023203111001 |
5 | 2403332103040 |
6 | 152320132001 |
7 | 23056334434 |
oct | 5113432501 |
9 | 1704031531 |
10 | 690894145 |
11 | 324a9aaa7 |
12 | 173467001 |
13 | b01a1806 |
14 | 67a8781b |
15 | 409c459a |
hex | 292e3541 |
690894145 has 8 divisors (see below), whose sum is σ = 832694760. Its totient is φ = 550300800.
The previous prime is 690894143. The next prime is 690894181. The reversal of 690894145 is 541498096.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 443649969 + 247244176 = 21063^2 + 15724^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 690894145 - 21 = 690894143 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 690894095 and 690894104.
It is not an unprimeable number, because it can be changed into a prime (690894143) 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, 300556 + ... + 302845.
It is an arithmetic number, because the mean of its divisors is an integer number (104086845).
Almost surely, 2690894145 is an apocalyptic number.
It is an amenable number.
690894145 is a deficient number, since it is larger than the sum of its proper divisors (141800615).
690894145 is a wasteful number, since it uses less digits than its factorization.
690894145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 603635.
The product of its (nonzero) digits is 311040, while the sum is 46.
The square root of 690894145 is about 26284.8653220822. The cubic root of 690894145 is about 884.0371261443.
The spelling of 690894145 in words is "six hundred ninety million, eight hundred ninety-four thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •