Base | Representation |
---|---|
bin | 10010101001100101100001… |
… | …01001000111100010100110 |
3 | 12101012122100210120120110111 |
4 | 21110302300221013202212 |
5 | 20333412131143423024 |
6 | 223120200351243234 |
7 | 11431653345254632 |
oct | 1124626051074246 |
9 | 171178323516414 |
10 | 41011311311014 |
11 | 12081888088390 |
12 | 472432521951a |
13 | 19b6472118c35 |
14 | a1ad5acabdc2 |
15 | 4b1be9517a94 |
hex | 254cb0a478a6 |
41011311311014 has 8 divisors (see below), whose sum is σ = 67109418508968. Its totient is φ = 18641505141360.
The previous prime is 41011311311011. The next prime is 41011311311081.
41011311311014 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 1864150514137 = 41011311311014 / (4 + 1 + 0 + 1 + 1 + 3 + 1 + 1 + 3 + 1 + 1 + 0 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41011311311011) 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, 932075257047 + ... + 932075257090.
It is an arithmetic number, because the mean of its divisors is an integer number (8388677313621).
Almost surely, 241011311311014 is an apocalyptic number.
41011311311014 is a deficient number, since it is larger than the sum of its proper divisors (26098107197954).
41011311311014 is a wasteful number, since it uses less digits than its factorization.
41011311311014 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1864150514150.
The product of its (nonzero) digits is 144, while the sum is 22.
It can be divided in two parts, 4101131 and 1311014, that added together give a palindrome (5412145).
The spelling of 41011311311014 in words is "forty-one trillion, eleven billion, three hundred eleven million, three hundred eleven thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •