Base | Representation |
---|---|
bin | 1001001110110111111110… |
… | …1110101000001011000010 |
3 | 1022221102220010211211211110 |
4 | 2103231333232220023002 |
5 | 2312304024031300200 |
6 | 33331212500024150 |
7 | 2065252655564364 |
oct | 223557756501302 |
9 | 38842803754743 |
10 | 10151150650050 |
11 | 32640959a1623 |
12 | 117b43b992056 |
13 | 588331c108a7 |
14 | 271465644d34 |
15 | 1290c4a60b50 |
hex | 93b7fba82c2 |
10151150650050 has 24 divisors (see below), whose sum is σ = 25174853612496. Its totient is φ = 2706973506640.
The previous prime is 10151150650027. The next prime is 10151150650057. The reversal of 10151150650050 is 5005605115101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (10151150650057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 33837168684 + ... + 33837168983.
It is an arithmetic number, because the mean of its divisors is an integer number (1048952233854).
Almost surely, 210151150650050 is an apocalyptic number.
10151150650050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10151150650050 is an abundant number, since it is smaller than the sum of its proper divisors (15023702962446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151150650050 is a wasteful number, since it uses less digits than its factorization.
10151150650050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67674337682 (or 67674337677 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 30.
Adding to 10151150650050 its reverse (5005605115101), we get a palindrome (15156755765151).
The spelling of 10151150650050 in words is "ten trillion, one hundred fifty-one billion, one hundred fifty million, six hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •