Base | Representation |
---|---|
bin | 11101011010001101101… |
… | …10011110101001101101 |
3 | 10120121021220022120111101 |
4 | 32231012312132221231 |
5 | 113024004014013010 |
6 | 2052115310323101 |
7 | 133002165200404 |
oct | 16550666365155 |
9 | 3517256276441 |
10 | 1010506001005 |
11 | 35a60a325a56 |
12 | 143a144b9491 |
13 | 743a0a5c697 |
14 | 36ca188463b |
15 | 1b443c7573a |
hex | eb46d9ea6d |
1010506001005 has 8 divisors (see below), whose sum is σ = 1217325518712. Its totient is φ = 805259255808.
The previous prime is 1010506000991. The next prime is 1010506001009. The reversal of 1010506001005 is 5001006050101.
It can be written as a sum of positive squares in 4 ways, for example, as 148122607689 + 862383393316 = 384867^2 + 928646^2 .
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 1010506001005 - 231 = 1008358517357 is a prime.
It is a super-2 number, since 2×10105060010052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010506001009) 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, 393191712 + ... + 393194281.
It is an arithmetic number, because the mean of its divisors is an integer number (152165689839).
Almost surely, 21010506001005 is an apocalyptic number.
It is an amenable number.
1010506001005 is a deficient number, since it is larger than the sum of its proper divisors (206819517707).
1010506001005 is an equidigital number, since it uses as much as digits as its factorization.
1010506001005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 786386255.
The product of its (nonzero) digits is 150, while the sum is 19.
The spelling of 1010506001005 in words is "one trillion, ten billion, five hundred six million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.781 sec. • engine limits •