Base | Representation |
---|---|
bin | 10010110010100100111001… |
… | …01011111001010100101010 |
3 | 12102022011200202202011220222 |
4 | 21121102130223321110222 |
5 | 20403442244304441302 |
6 | 223514124435050042 |
7 | 11463200266061444 |
oct | 1131223453712452 |
9 | 172264622664828 |
10 | 41320214140202 |
11 | 12190893736a58 |
12 | 4774174140922 |
13 | 1a09630534cba |
14 | a2bca256d494 |
15 | 4b9c785abda2 |
hex | 25949caf952a |
41320214140202 has 8 divisors (see below), whose sum is σ = 64675117784736. Its totient is φ = 19761841545292.
The previous prime is 41320214140189. The next prime is 41320214140241. The reversal of 41320214140202 is 20204141202314.
41320214140202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×413202141402022 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 449132762348 + ... + 449132762439.
It is an arithmetic number, because the mean of its divisors is an integer number (8084389723092).
Almost surely, 241320214140202 is an apocalyptic number.
41320214140202 is a deficient number, since it is larger than the sum of its proper divisors (23354903644534).
41320214140202 is a wasteful number, since it uses less digits than its factorization.
41320214140202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 898265524812.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 41320214140202 its reverse (20204141202314), we get a palindrome (61524355342516).
The spelling of 41320214140202 in words is "forty-one trillion, three hundred twenty billion, two hundred fourteen million, one hundred forty thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •