Base | Representation |
---|---|
bin | 1001000110001000101000… |
… | …0101101010011100111100 |
3 | 1022102002022221001021112100 |
4 | 2101202022011222130330 |
5 | 2302324022123334000 |
6 | 33134221331305100 |
7 | 2051356055346432 |
oct | 221421205523474 |
9 | 38362287037470 |
10 | 10001000605500 |
11 | 3206445130813 |
12 | 1156316a4b190 |
13 | 577123548198 |
14 | 26809dd96d52 |
15 | 125237be3a00 |
hex | 9188a16a73c |
10001000605500 has 144 divisors (see below), whose sum is σ = 31569237764064. Its totient is φ = 2665292371200.
The previous prime is 10001000605489. The next prime is 10001000605507. The reversal of 10001000605500 is 550600010001.
10001000605500 is a `hidden beast` number, since 1 + 0 + 0 + 0 + 10 + 0 + 0 + 605 + 50 + 0 = 666.
It is a super-2 number, since 2×100010006055002 (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 (10001000605507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6638512 + ... + 8004488.
It is an arithmetic number, because the mean of its divisors is an integer number (219230817806).
Almost surely, 210001000605500 is an apocalyptic number.
10001000605500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10001000605500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15784618882032).
10001000605500 is an abundant number, since it is smaller than the sum of its proper divisors (21568237158564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001000605500 is a wasteful number, since it uses less digits than its factorization.
10001000605500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1367629 (or 1367614 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
Adding to 10001000605500 its reverse (550600010001), we get a palindrome (10551600615501).
The spelling of 10001000605500 in words is "ten trillion, one billion, six hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •