Base | Representation |
---|---|
bin | 11110100100001001110… |
… | …10110110110100000101 |
3 | 10201101202101102101002022 |
4 | 33102010322312310011 |
5 | 114201303210312410 |
6 | 2122242310252525 |
7 | 135605662031243 |
oct | 17220472666405 |
9 | 3641671371068 |
10 | 1050202041605 |
11 | 37542a745882 |
12 | 14b652657145 |
13 | 78058b58bc2 |
14 | 38b8992b793 |
15 | 1c4b8c1a455 |
hex | f484eb6d05 |
1050202041605 has 4 divisors (see below), whose sum is σ = 1260242449932. Its totient is φ = 840161633280.
The previous prime is 1050202041547. The next prime is 1050202041617. The reversal of 1050202041605 is 5061402020501.
1050202041605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 450961942369 + 599240099236 = 671537^2 + 774106^2 .
It is not a de Polignac number, because 1050202041605 - 28 = 1050202041349 is a prime.
It is a super-2 number, since 2×10502020416052 (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 3 ways as a sum of consecutive naturals, for example, 105020204156 + ... + 105020204165.
It is an arithmetic number, because the mean of its divisors is an integer number (315060612483).
Almost surely, 21050202041605 is an apocalyptic number.
It is an amenable number.
1050202041605 is a deficient number, since it is larger than the sum of its proper divisors (210040408327).
1050202041605 is an equidigital number, since it uses as much as digits as its factorization.
1050202041605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210040408326.
The product of its (nonzero) digits is 2400, while the sum is 26.
The spelling of 1050202041605 in words is "one trillion, fifty billion, two hundred two million, forty-one thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •