Base | Representation |
---|---|
bin | 100110011010011101… |
… | …001001001110100010 |
3 | 10221110111200202210020 |
4 | 212122131021032202 |
5 | 1133432441140043 |
6 | 30540445414310 |
7 | 2660054346303 |
oct | 463235111642 |
9 | 127414622706 |
10 | 41246036898 |
11 | 16546349000 |
12 | 7bb126a396 |
13 | 3b742752c1 |
14 | 1dd3c827aa |
15 | 11160b7e83 |
hex | 99a7493a2 |
41246036898 has 64 divisors (see below), whose sum is σ = 93188050560. Its totient is φ = 12160906560.
The previous prime is 41246036863. The next prime is 41246036899. The reversal of 41246036898 is 89863064214.
It is a self number, because there is not a number n which added to its sum of digits gives 41246036898.
It is not an unprimeable number, because it can be changed into a prime (41246036899) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 225688 + ... + 365276.
It is an arithmetic number, because the mean of its divisors is an integer number (1456063290).
Almost surely, 241246036898 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41246036898, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46594025280).
41246036898 is an abundant number, since it is smaller than the sum of its proper divisors (51942013662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41246036898 is a wasteful number, since it uses less digits than its factorization.
41246036898 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139664 (or 139642 counting only the distinct ones).
The product of its (nonzero) digits is 1990656, while the sum is 51.
The spelling of 41246036898 in words is "forty-one billion, two hundred forty-six million, thirty-six thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •