Base | Representation |
---|---|
bin | 10100000110011110110… |
… | …11011111000010100110 |
3 | 2110000202022121000011000 |
4 | 22003033123133002212 |
5 | 42304000230343402 |
6 | 1245142555054130 |
7 | 100620365261040 |
oct | 12031733370246 |
9 | 2400668530130 |
10 | 690674856102 |
11 | 246a05a50000 |
12 | b1a35741346 |
13 | 5019052730a |
14 | 25600a52a90 |
15 | 12e755a1c1c |
hex | a0cf6df0a6 |
690674856102 has 160 divisors (see below), whose sum is σ = 1929507840000. Its totient is φ = 179394629040.
The previous prime is 690674856083. The next prime is 690674856143. The reversal of 690674856102 is 201658476096.
690674856102 is a `hidden beast` number, since 6 + 9 + 0 + 6 + 74 + 8 + 561 + 0 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 5471899 + ... + 5596697.
It is an arithmetic number, because the mean of its divisors is an integer number (12059424000).
Almost surely, 2690674856102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 690674856102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (964753920000).
690674856102 is an abundant number, since it is smaller than the sum of its proper divisors (1238832983898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
690674856102 is a wasteful number, since it uses less digits than its factorization.
690674856102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124861 (or 124822 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 54.
The spelling of 690674856102 in words is "six hundred ninety billion, six hundred seventy-four million, eight hundred fifty-six thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •