Base | Representation |
---|---|
bin | 101001001010110… |
… | …010111101000110 |
3 | 1210010122222210120 |
4 | 221022302331012 |
5 | 2403304233011 |
6 | 152312002410 |
7 | 23054550660 |
oct | 5112627506 |
9 | 1703588716 |
10 | 690696006 |
11 | 324975150 |
12 | 173390406 |
13 | b0132580 |
14 | 67a35530 |
15 | 40985a06 |
hex | 292b2f46 |
690696006 has 64 divisors (see below), whose sum is σ = 1854752256. Its totient is φ = 165600000.
The previous prime is 690695989. The next prime is 690696007. The reversal of 690696006 is 600696096.
690696006 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (690696007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51495 + ... + 63506.
It is an arithmetic number, because the mean of its divisors is an integer number (28980504).
Almost surely, 2690696006 is an apocalyptic number.
690696006 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
690696006 is an abundant number, since it is smaller than the sum of its proper divisors (1164056250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690696006 is a wasteful number, since it uses less digits than its factorization.
690696006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115037.
The product of its (nonzero) digits is 104976, while the sum is 42.
The square root of 690696006 is about 26281.0959817128. The cubic root of 690696006 is about 883.9526081416.
It can be divided in two parts, 69069 and 6006, that multiplied together give a palindrome (414828414).
The spelling of 690696006 in words is "six hundred ninety million, six hundred ninety-six thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •