Base | Representation |
---|---|
bin | 10010101001111001110011… |
… | …10001111000010011110110 |
3 | 12101020200110210100222010200 |
4 | 21110330321301320103312 |
5 | 20334101432204133420 |
6 | 223125201153101330 |
7 | 11432520256624212 |
oct | 1124747161702366 |
9 | 171220423328120 |
10 | 41022202021110 |
11 | 1208646665a042 |
12 | 4726464557846 |
13 | 19b74b94c94ab |
14 | a1b6b144d942 |
15 | 4b21356b9b90 |
hex | 254f39c784f6 |
41022202021110 has 96 divisors (see below), whose sum is σ = 110226029292288. Its totient is φ = 10577996298240.
The previous prime is 41022202021109. The next prime is 41022202021127. The reversal of 41022202021110 is 1112020222014.
41022202021110 is a `hidden beast` number, since 410 + 2 + 2 + 20 + 20 + 211 + 1 + 0 = 666.
It is a super-2 number, since 2×410222020211102 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 48773862 + ... + 49607801.
It is an arithmetic number, because the mean of its divisors is an integer number (1148187805128).
Almost surely, 241022202021110 is an apocalyptic number.
41022202021110 is an abundant number, since it is smaller than the sum of its proper divisors (69203827271178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41022202021110 is a wasteful number, since it uses less digits than its factorization.
41022202021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98381830 (or 98381827 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 41022202021110 its reverse (1112020222014), we get a palindrome (42134222243124).
The spelling of 41022202021110 in words is "forty-one trillion, twenty-two billion, two hundred two million, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •