Base | Representation |
---|---|
bin | 10010101010011111010000… |
… | …11111100100011111010001 |
3 | 12101022121101100220210112002 |
4 | 21111033220133210133101 |
5 | 20334414124123301223 |
6 | 223142324531243345 |
7 | 11434131531201014 |
oct | 1125175037443721 |
9 | 171277340823462 |
10 | 41042313103313 |
11 | 12093a46859835 |
12 | 472a337749555 |
13 | 19b9372bc7c32 |
14 | a1c65c3ad37b |
15 | 4b2911078e28 |
hex | 2553e87e47d1 |
41042313103313 has 8 divisors (see below), whose sum is σ = 41049923048448. Its totient is φ = 41034703716864.
The previous prime is 41042313103277. The next prime is 41042313103343. The reversal of 41042313103313 is 31330131324014.
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 41042313103313 - 26 = 41042313103249 is a prime.
It is a super-2 number, since 2×410423131033132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41042313103343) 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, 164371520 + ... + 164621022.
It is an arithmetic number, because the mean of its divisors is an integer number (5131240381056).
Almost surely, 241042313103313 is an apocalyptic number.
It is an amenable number.
41042313103313 is a deficient number, since it is larger than the sum of its proper divisors (7609945135).
41042313103313 is a wasteful number, since it uses less digits than its factorization.
41042313103313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279343.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 41042313103313 its reverse (31330131324014), we get a palindrome (72372444427327).
The spelling of 41042313103313 in words is "forty-one trillion, forty-two billion, three hundred thirteen million, one hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •