Base | Representation |
---|---|
bin | 10010101010001100011011… |
… | …10001110000100010010001 |
3 | 12101021122021122121101121222 |
4 | 21111012031301300202101 |
5 | 20334232422002210001 |
6 | 223133533310254425 |
7 | 11433323124420341 |
oct | 1125061561604221 |
9 | 171248248541558 |
10 | 41032201210001 |
11 | 1208a72796a711 |
12 | 47283951b7415 |
13 | 19b8420c91701 |
14 | a1bd7d440d21 |
15 | 4b251d46761b |
hex | 25518dc70891 |
41032201210001 has 16 divisors (see below), whose sum is σ = 42575540367360. Its totient is φ = 39502843853760.
The previous prime is 41032201209941. The next prime is 41032201210069. The reversal of 41032201210001 is 10001210223014.
It is a cyclic number.
It is not a de Polignac number, because 41032201210001 - 222 = 41032197015697 is a prime.
It is a super-2 number, since 2×410322012100012 (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 (41032201210901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7801871 + ... + 11955483.
It is an arithmetic number, because the mean of its divisors is an integer number (2660971272960).
Almost surely, 241032201210001 is an apocalyptic number.
It is an amenable number.
41032201210001 is a deficient number, since it is larger than the sum of its proper divisors (1543339157359).
41032201210001 is a wasteful number, since it uses less digits than its factorization.
41032201210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4155296.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 41032201210001 its reverse (10001210223014), we get a palindrome (51033411433015).
The spelling of 41032201210001 in words is "forty-one trillion, thirty-two billion, two hundred one million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •