Base | Representation |
---|---|
bin | 1001100011100100001011… |
… | …0001011011111010011100 |
3 | 1101012102101201211001100211 |
4 | 2120321002301123322130 |
5 | 2334120014211333120 |
6 | 34202400425102204 |
7 | 2133035411460562 |
oct | 230710261337234 |
9 | 41172351731324 |
10 | 10506610261660 |
11 | 3390912649987 |
12 | 1218302627964 |
13 | 5b29cc921616 |
14 | 284746219a32 |
15 | 13347b05725a |
hex | 98e42c5be9c |
10506610261660 has 48 divisors (see below), whose sum is σ = 22086097074720. Its totient is φ = 4198413390080.
The previous prime is 10506610261639. The next prime is 10506610261673. The reversal of 10506610261660 is 6616201660501.
10506610261660 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-2 number, since 2×105066102616602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 284351307 + ... + 284388253.
It is an arithmetic number, because the mean of its divisors is an integer number (460127022390).
Almost surely, 210506610261660 is an apocalyptic number.
10506610261660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10506610261660 is an abundant number, since it is smaller than the sum of its proper divisors (11579486813060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10506610261660 is a wasteful number, since it uses less digits than its factorization.
10506610261660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50886 (or 50884 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 40.
The spelling of 10506610261660 in words is "ten trillion, five hundred six billion, six hundred ten million, two hundred sixty-one thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •