Base | Representation |
---|---|
bin | 1001101001000011110011… |
… | …0111101000111010101101 |
3 | 1101112110000221201020011112 |
4 | 2122100330313220322231 |
5 | 2342141322112130010 |
6 | 34314010555401405 |
7 | 2142616450345451 |
oct | 232207467507255 |
9 | 41473027636145 |
10 | 10601000505005 |
11 | 341794a465859 |
12 | 1232665753265 |
13 | 5bb89316ba11 |
14 | 28913c212661 |
15 | 135b52a41a05 |
hex | 9a43cde8ead |
10601000505005 has 8 divisors (see below), whose sum is σ = 13274296284672. Its totient is φ = 8112069951568.
The previous prime is 10601000504947. The next prime is 10601000505013. The reversal of 10601000505005 is 50050500010601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10601000505005 - 28 = 10601000504749 is a prime.
It is a super-2 number, since 2×106010005050052 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
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, 46091306429 + ... + 46091306658.
It is an arithmetic number, because the mean of its divisors is an integer number (1659287035584).
Almost surely, 210601000505005 is an apocalyptic number.
It is an amenable number.
10601000505005 is a deficient number, since it is larger than the sum of its proper divisors (2673295779667).
10601000505005 is an equidigital number, since it uses as much as digits as its factorization.
10601000505005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92182613115.
The product of its (nonzero) digits is 750, while the sum is 23.
Adding to 10601000505005 its reverse (50050500010601), we get a palindrome (60651500515606).
The spelling of 10601000505005 in words is "ten trillion, six hundred one billion, five hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •