Base | Representation |
---|---|
bin | 10010110110110010111000… |
… | …10000010101000111010011 |
3 | 12102211000211102211102221222 |
4 | 21123121130100111013103 |
5 | 20413331122441411433 |
6 | 224104455452035255 |
7 | 11506521241055555 |
oct | 1133313420250723 |
9 | 172730742742858 |
10 | 41465162060243 |
11 | 12237304a96709 |
12 | 4798286a62b2b |
13 | 1a1a1c021c81c |
14 | a34cd2d834d5 |
15 | 4bd90d898b98 |
hex | 25b65c4151d3 |
41465162060243 has 4 divisors (see below), whose sum is σ = 41990037529440. Its totient is φ = 40940286591048.
The previous prime is 41465162060207. The next prime is 41465162060249. The reversal of 41465162060243 is 34206026156414.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 41465162060243 - 28 = 41465162059987 is a prime.
It is a super-2 number, since 2×414651620602432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41465162060194 and 41465162060203.
It is not an unprimeable number, because it can be changed into a prime (41465162060249) 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, 262437734480 + ... + 262437734637.
It is an arithmetic number, because the mean of its divisors is an integer number (10497509382360).
Almost surely, 241465162060243 is an apocalyptic number.
41465162060243 is a deficient number, since it is larger than the sum of its proper divisors (524875469197).
41465162060243 is an equidigital number, since it uses as much as digits as its factorization.
41465162060243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524875469196.
The product of its (nonzero) digits is 829440, while the sum is 44.
The spelling of 41465162060243 in words is "forty-one trillion, four hundred sixty-five billion, one hundred sixty-two million, sixty thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •