Base | Representation |
---|---|
bin | 101001001001000… |
… | …000000000000000 |
3 | 1210002210001220112 |
4 | 221021000000000 |
5 | 2403144201102 |
6 | 152253530452 |
7 | 23050550141 |
oct | 5111000000 |
9 | 1702701815 |
10 | 690225152 |
11 | 324683411 |
12 | 1731a3a28 |
13 | accc9166 |
14 | 67951ac8 |
15 | 408e1252 |
hex | 29240000 |
690225152 has 38 divisors (see below), whose sum is σ = 1380971958. Its totient is φ = 344981504.
The previous prime is 690225149. The next prime is 690225161. The reversal of 690225152 is 251522096.
It can be written as a sum of positive squares in only one way, i.e., 484704256 + 205520896 = 22016^2 + 14336^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a nialpdrome in base 8.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 260828 + ... + 263460.
Almost surely, 2690225152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 690225152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (690485979).
690225152 is an abundant number, since it is smaller than the sum of its proper divisors (690746806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690225152 is an frugal number, since it uses more digits than its factorization.
690225152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2669 (or 2635 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 32.
The square root of 690225152 is about 26272.1364186470. The cubic root of 690225152 is about 883.7516961957.
The spelling of 690225152 in words is "six hundred ninety million, two hundred twenty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •