Base | Representation |
---|---|
bin | 11101111000011000001… |
… | …01101100110100110100 |
3 | 10122011002111012012021112 |
4 | 32330030011230310310 |
5 | 113310140200122120 |
6 | 2103354240134152 |
7 | 134114404022141 |
oct | 16741405546464 |
9 | 3564074165245 |
10 | 1026700004660 |
11 | 36646a428650 |
12 | 146b93907358 |
13 | 75a81a80775 |
14 | 3799a4b73c8 |
15 | 1ba907ddbc5 |
hex | ef0c16cd34 |
1026700004660 has 24 divisors (see below), whose sum is σ = 2352076374816. Its totient is φ = 373345456160.
The previous prime is 1026700004611. The next prime is 1026700004711. The reversal of 1026700004660 is 664000076201.
1026700004660 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-4 number, since 4×10267000046604 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2333408882 + ... + 2333409321.
It is an arithmetic number, because the mean of its divisors is an integer number (98003182284).
Almost surely, 21026700004660 is an apocalyptic number.
1026700004660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1026700004660 is an abundant number, since it is smaller than the sum of its proper divisors (1325376370156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026700004660 is a wasteful number, since it uses less digits than its factorization.
1026700004660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4666818223 (or 4666818221 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 32.
The spelling of 1026700004660 in words is "one trillion, twenty-six billion, seven hundred million, four thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •