Base | Representation |
---|---|
bin | 1001101001000011110011… |
… | …1001100001111000111001 |
3 | 1101112110000222122101212101 |
4 | 2122100330321201320321 |
5 | 2342141322224004010 |
6 | 34314011014143401 |
7 | 2142616454511166 |
oct | 232207471417071 |
9 | 41473028571771 |
10 | 10601001000505 |
11 | 341794a774063 |
12 | 1232665951b61 |
13 | 5bb8932b3406 |
14 | 28913c30106d |
15 | 135b52add73a |
hex | 9a43ce61e39 |
10601001000505 has 8 divisors (see below), whose sum is σ = 12759633834624. Its totient is φ = 8455179044400.
The previous prime is 10601001000503. The next prime is 10601001000509. The reversal of 10601001000505 is 50500010010601.
10601001000505 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10601001000505 - 21 = 10601001000503 is a prime.
It is a super-2 number, since 2×106010010005052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian 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 7 ways as a sum of consecutive naturals, for example, 3202717681 + ... + 3202720990.
It is an arithmetic number, because the mean of its divisors is an integer number (1594954229328).
Almost surely, 210601001000505 is an apocalyptic number.
It is an amenable number.
10601001000505 is a deficient number, since it is larger than the sum of its proper divisors (2158632834119).
10601001000505 is an equidigital number, since it uses as much as digits as its factorization.
10601001000505 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6405439007.
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 10601001000505 in words is "ten trillion, six hundred one billion, one million, five hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •