Base | Representation |
---|---|
bin | 10010110111000001011111… |
… | …00110010001110111111011 |
3 | 12102211210001212111222020012 |
4 | 21123200233212101313323 |
5 | 20413443202202232021 |
6 | 224112233501452135 |
7 | 11510216446041434 |
oct | 1133405746216773 |
9 | 172753055458205 |
10 | 41473002774011 |
11 | 1223a668959a46 |
12 | 47998b487104b |
13 | 1a1ab6c762023 |
14 | a3543842648b |
15 | 4bdc1bdcd35b |
hex | 25b82f991dfb |
41473002774011 has 8 divisors (see below), whose sum is σ = 41975016413904. Its totient is φ = 40971044822560.
The previous prime is 41473002773987. The next prime is 41473002774067. The reversal of 41473002774011 is 11047720037414.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41473002774011 is a prime.
It is a super-2 number, since 2×414730027740112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41473002774011.
It is not an unprimeable number, because it can be changed into a prime (41473002779011) 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, 12422660 + ... + 15403521.
It is an arithmetic number, because the mean of its divisors is an integer number (5246877051738).
Almost surely, 241473002774011 is an apocalyptic number.
41473002774011 is a deficient number, since it is larger than the sum of its proper divisors (502013639893).
41473002774011 is a wasteful number, since it uses less digits than its factorization.
41473002774011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27844221.
The product of its (nonzero) digits is 131712, while the sum is 41.
The spelling of 41473002774011 in words is "forty-one trillion, four hundred seventy-three billion, two million, seven hundred seventy-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •