Base | Representation |
---|---|
bin | 11110100100101101010… |
… | …11111000001100101101 |
3 | 10201102112011021120012111 |
4 | 33102112223320030231 |
5 | 114202411011330010 |
6 | 2122332035004021 |
7 | 135616241363611 |
oct | 17222653701455 |
9 | 3642464246174 |
10 | 1050500105005 |
11 | 375572a1726a |
12 | 14b716439611 |
13 | 780a5829390 |
14 | 38bb7359341 |
15 | 1c4d4e9558a |
hex | f496af832d |
1050500105005 has 8 divisors (see below), whose sum is σ = 1357569366552. Its totient is φ = 775753923648.
The previous prime is 1050500104999. The next prime is 1050500105023. The reversal of 1050500105005 is 5005010050501.
It can be written as a sum of positive squares in 4 ways, for example, as 79932294729 + 970567810276 = 282723^2 + 985174^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 1050500105005 - 217 = 1050499973933 is a prime.
It is a super-2 number, since 2×10505001050052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian 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, 8080769974 + ... + 8080770103.
It is an arithmetic number, because the mean of its divisors is an integer number (169696170819).
Almost surely, 21050500105005 is an apocalyptic number.
It is an amenable number.
1050500105005 is a deficient number, since it is larger than the sum of its proper divisors (307069261547).
1050500105005 is a wasteful number, since it uses less digits than its factorization.
1050500105005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16161540095.
The product of its (nonzero) digits is 625, while the sum is 22.
Adding to 1050500105005 its reverse (5005010050501), we get a palindrome (6055510155506).
The spelling of 1050500105005 in words is "one trillion, fifty billion, five hundred million, one hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •