Base | Representation |
---|---|
bin | 101001000111001100110… |
… | …1010100000010000001001 |
3 | 202000011211021110100002111 |
4 | 1102032121222200100021 |
5 | 1220034120233103231 |
6 | 20003441400502321 |
7 | 1122142444651633 |
oct | 122163152402011 |
9 | 22004737410074 |
10 | 5650460050441 |
11 | 188938a433888 |
12 | 77311b77a9a1 |
13 | 31cab3b9998b |
14 | 1576ab4b3a53 |
15 | 9beac50a4b1 |
hex | 52399aa0409 |
5650460050441 has 4 divisors (see below), whose sum is σ = 5650730467092. Its totient is φ = 5650189633792.
The previous prime is 5650460050409. The next prime is 5650460050489. The reversal of 5650460050441 is 1440500640565.
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 3271449951225 + 2379010099216 = 1808715^2 + 1542404^2 .
It is a cyclic number.
It is not a de Polignac number, because 5650460050441 - 25 = 5650460050409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5650460050394 and 5650460050403.
It is not an unprimeable number, because it can be changed into a prime (5650460051441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135176980 + ... + 135218773.
It is an arithmetic number, because the mean of its divisors is an integer number (1412682616773).
Almost surely, 25650460050441 is an apocalyptic number.
It is an amenable number.
5650460050441 is a deficient number, since it is larger than the sum of its proper divisors (270416651).
5650460050441 is a wasteful number, since it uses less digits than its factorization.
5650460050441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 270416650.
The product of its (nonzero) digits is 288000, while the sum is 40.
The spelling of 5650460050441 in words is "five trillion, six hundred fifty billion, four hundred sixty million, fifty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.988 sec. • engine limits •