Base | Representation |
---|---|
bin | 100110010001111101… |
… | …001100100111100010 |
3 | 10221002120101022201110 |
4 | 212101331030213202 |
5 | 1133134440210300 |
6 | 30514353244150 |
7 | 2653403341005 |
oct | 462175144742 |
9 | 127076338643 |
10 | 41103444450 |
11 | 16482906202 |
12 | 7b71563656 |
13 | 3b5086ac83 |
14 | 1dbcd6553c |
15 | 11087ed550 |
hex | 991f4c9e2 |
41103444450 has 96 divisors (see below), whose sum is σ = 104735171520. Its totient is φ = 10663833600.
The previous prime is 41103444433. The next prime is 41103444469. The reversal of 41103444450 is 5444430114.
41103444450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 834510 + ... + 882390.
It is an arithmetic number, because the mean of its divisors is an integer number (1090991370).
Almost surely, 241103444450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41103444450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52367585760).
41103444450 is an abundant number, since it is smaller than the sum of its proper divisors (63631727070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41103444450 is a wasteful number, since it uses less digits than its factorization.
41103444450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48052 (or 48047 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 41103444450 its reverse (5444430114), we get a palindrome (46547874564).
The spelling of 41103444450 in words is "forty-one billion, one hundred three million, four hundred forty-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •