Base | Representation |
---|---|
bin | 1100001111010… |
… | …01101000000100 |
3 | 21011012010010022 |
4 | 12013221220010 |
5 | 202240400204 |
6 | 14104314312 |
7 | 2354445650 |
oct | 607515004 |
9 | 234163108 |
10 | 102668804 |
11 | 52a54657 |
12 | 2a472998 |
13 | 18369494 |
14 | d8c7a60 |
15 | 90305be |
hex | 61e9a04 |
102668804 has 12 divisors (see below), whose sum is σ = 205337664. Its totient is φ = 44000904.
The previous prime is 102668801. The next prime is 102668843. The reversal of 102668804 is 408866201.
102668804 is an admirable number.
It is a super-4 number, since 4×1026688044 (a number of 33 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (102668801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1833344 + ... + 1833399.
It is an arithmetic number, because the mean of its divisors is an integer number (17111472).
Almost surely, 2102668804 is an apocalyptic number.
102668804 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
102668804 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102668804 is a wasteful number, since it uses less digits than its factorization.
102668804 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3666754 (or 3666752 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 35.
The square root of 102668804 is about 10132.5615714882. The cubic root of 102668804 is about 468.2518490078.
The spelling of 102668804 in words is "one hundred two million, six hundred sixty-eight thousand, eight hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •