Base | Representation |
---|---|
bin | 1001101001010110011011… |
… | …1011001110011100001111 |
3 | 1101112220221110010111212112 |
4 | 2122111212323032130033 |
5 | 2342232042232234003 |
6 | 34320155110454235 |
7 | 2143154410335050 |
oct | 232254673163417 |
9 | 41486843114775 |
10 | 10606001055503 |
11 | 3419a86109417 |
12 | 123362036437b |
13 | 5bc1ac161039 |
14 | 2894943b8727 |
15 | 135d46a563d8 |
hex | 9a566ece70f |
10606001055503 has 8 divisors (see below), whose sum is σ = 12122286251808. Its totient is φ = 9090001406304.
The previous prime is 10606001055451. The next prime is 10606001055521. The reversal of 10606001055503 is 30555010060601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10606001055503 - 26 = 10606001055439 is a prime.
It is a super-2 number, since 2×106060010555032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10606001055503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10606001052503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71307176 + ... + 71455757.
It is an arithmetic number, because the mean of its divisors is an integer number (1515285781476).
Almost surely, 210606001055503 is an apocalyptic number.
10606001055503 is a deficient number, since it is larger than the sum of its proper divisors (1516285196305).
10606001055503 is a wasteful number, since it uses less digits than its factorization.
10606001055503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142773553.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 10606001055503 in words is "ten trillion, six hundred six billion, one million, fifty-five thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •