Base | Representation |
---|---|
bin | 100110011101110011… |
… | …000011111110101100 |
3 | 10221121102012210102002 |
4 | 212131303003332230 |
5 | 1134041320123340 |
6 | 30550211351432 |
7 | 2661335115113 |
oct | 463563037654 |
9 | 127542183362 |
10 | 41302114220 |
11 | 16574a6a7a4 |
12 | 8007bb2578 |
13 | 3b82a7a953 |
14 | 1ddb4bcc7a |
15 | 111ae93715 |
hex | 99dcc3fac |
41302114220 has 12 divisors (see below), whose sum is σ = 86734439904. Its totient is φ = 16520845680.
The previous prime is 41302114213. The next prime is 41302114223. The reversal of 41302114220 is 2241120314.
It is a Harshad number since it is a multiple of its sum of digits (20), and also a Moran number because the ratio is a prime number: 2065105711 = 41302114220 / (4 + 1 + 3 + 0 + 2 + 1 + 1 + 4 + 2 + 2 + 0).
It is a junction number, because it is equal to n+sod(n) for n = 41302114192 and 41302114201.
It is not an unprimeable number, because it can be changed into a prime (41302114223) 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, 1032552836 + ... + 1032552875.
It is an arithmetic number, because the mean of its divisors is an integer number (7227869992).
Almost surely, 241302114220 is an apocalyptic number.
It is an amenable number.
41302114220 is an abundant number, since it is smaller than the sum of its proper divisors (45432325684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41302114220 is a wasteful number, since it uses less digits than its factorization.
41302114220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2065105720 (or 2065105718 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 41302114220 its reverse (2241120314), we get a palindrome (43543234534).
The spelling of 41302114220 in words is "forty-one billion, three hundred two million, one hundred fourteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •