Base | Representation |
---|---|
bin | 1001101001000011110011… |
… | …1001100001111000111000 |
3 | 1101112110000222122101212100 |
4 | 2122100330321201320320 |
5 | 2342141322224004004 |
6 | 34314011014143400 |
7 | 2142616454511165 |
oct | 232207471417070 |
9 | 41473028571770 |
10 | 10601001000504 |
11 | 341794a774062 |
12 | 1232665951b60 |
13 | 5bb8932b3405 |
14 | 28913c30106c |
15 | 135b52add739 |
hex | 9a43ce61e38 |
10601001000504 has 48 divisors (see below), whose sum is σ = 28715677146000. Its totient is φ = 3533096813184.
The previous prime is 10601001000503. The next prime is 10601001000509. The reversal of 10601001000504 is 40500010010601.
10601001000504 is a `hidden beast` number, since 1 + 0 + 60 + 1 + 0 + 0 + 100 + 0 + 504 = 666.
It is a super-2 number, since 2×106010010005042 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10601001000503) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11429469 + ... + 12322124.
It is an arithmetic number, because the mean of its divisors is an integer number (598243273875).
Almost surely, 210601001000504 is an apocalyptic number.
It is an amenable number.
10601001000504 is an abundant number, since it is smaller than the sum of its proper divisors (18114676145496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10601001000504 is a wasteful number, since it uses less digits than its factorization.
10601001000504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23757804 (or 23757797 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The spelling of 10601001000504 in words is "ten trillion, six hundred one billion, one million, five hundred four", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •