Base | Representation |
---|---|
bin | 10010101110000101… |
… | …00001100100000000 |
3 | 221221102020202222111 |
4 | 21113002201210000 |
5 | 131040323323034 |
6 | 4341134545104 |
7 | 504024260605 |
oct | 112702414400 |
9 | 27842222874 |
10 | 10050214144 |
11 | 42980a1703 |
12 | 1b45968194 |
13 | c4221c199 |
14 | 6b4ab46ac |
15 | 3dc4cb364 |
hex | 2570a1900 |
10050214144 has 36 divisors (see below), whose sum is σ = 20113744896. Its totient is φ = 5011937792.
The previous prime is 10050214129. The next prime is 10050214147. The reversal of 10050214144 is 44141205001.
It is not an unprimeable number, because it can be changed into a prime (10050214147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46797 + ... + 149299.
It is an arithmetic number, because the mean of its divisors is an integer number (558715136).
Almost surely, 210050214144 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 10050214144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10056872448).
10050214144 is an abundant number, since it is smaller than the sum of its proper divisors (10063530752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10050214144 is an equidigital number, since it uses as much as digits as its factorization.
10050214144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102902 (or 102888 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 10050214144 its reverse (44141205001), we get a palindrome (54191419145).
The spelling of 10050214144 in words is "ten billion, fifty million, two hundred fourteen thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •