Base | Representation |
---|---|
bin | 100110011001000010… |
… | …001110001110111100 |
3 | 10221101211211211212100 |
4 | 212121002032032330 |
5 | 1133410340433200 |
6 | 30534234505100 |
7 | 2656344636546 |
oct | 463102161674 |
9 | 127354754770 |
10 | 41222202300 |
11 | 16533949794 |
12 | 7ba5295190 |
13 | 3b6c34b6a6 |
14 | 1dd0a3a696 |
15 | 1113e5ad00 |
hex | 99908e3bc |
41222202300 has 108 divisors (see below), whose sum is σ = 130195401336. Its totient is φ = 10908643200.
The previous prime is 41222202271. The next prime is 41222202313. The reversal of 41222202300 is 320222214.
41222202300 is a `hidden beast` number, since 412 + 2 + 2 + 20 + 230 + 0 = 666.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 56919 + ... + 292718.
Almost surely, 241222202300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41222202300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65097700668).
41222202300 is an abundant number, since it is smaller than the sum of its proper divisors (88973199036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41222202300 is a wasteful number, since it uses less digits than its factorization.
41222202300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349788 (or 349778 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 41222202300 its reverse (320222214), we get a palindrome (41542424514).
The spelling of 41222202300 in words is "forty-one billion, two hundred twenty-two million, two hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •