Base | Representation |
---|---|
bin | 111011110101100110111… |
… | …001100000111010110000 |
3 | 112120002211001101001212110 |
4 | 323311212321200322300 |
5 | 1014332344033232334 |
6 | 12425010434125320 |
7 | 603040304525202 |
oct | 73654671407260 |
9 | 15502731331773 |
10 | 4112010055344 |
11 | 1345991527044 |
12 | 564b27a20840 |
13 | 23a9b78807a9 |
14 | 103045478772 |
15 | 71e6979eae9 |
hex | 3bd66e60eb0 |
4112010055344 has 120 divisors (see below), whose sum is σ = 11297575120720. Its totient is φ = 1288526303232.
The previous prime is 4112010055343. The next prime is 4112010055459. The reversal of 4112010055344 is 4435500102114.
It is not an unprimeable number, because it can be changed into a prime (4112010055343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11659062 + ... + 12006570.
Almost surely, 24112010055344 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 4112010055344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5648787560360).
4112010055344 is an abundant number, since it is smaller than the sum of its proper divisors (7185565065376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4112010055344 is a wasteful number, since it uses less digits than its factorization.
4112010055344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 348407 (or 348384 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 4112010055344 its reverse (4435500102114), we get a palindrome (8547510157458).
The spelling of 4112010055344 in words is "four trillion, one hundred twelve billion, ten million, fifty-five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •