Base | Representation |
---|---|
bin | 10000010110011000011… |
… | …010010101100011111110 |
3 | 10222102001200022202012222 |
4 | 100112120122111203332 |
5 | 121402004114131100 |
6 | 2220052044325342 |
7 | 144113312135153 |
oct | 20263032254376 |
9 | 3872050282188 |
10 | 1123543505150 |
11 | 3a3546021970 |
12 | 161900543852 |
13 | 81c46642601 |
14 | 3c54623422a |
15 | 1e35c86e485 |
hex | 105986958fe |
1123543505150 has 96 divisors (see below), whose sum is σ = 2293368215040. Its totient is φ = 406130816000.
The previous prime is 1123543505069. The next prime is 1123543505159. The reversal of 1123543505150 is 515053453211.
It is a self number, because there is not a number n which added to its sum of digits gives 1123543505150.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123543505159) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 77153870 + ... + 77168430.
It is an arithmetic number, because the mean of its divisors is an integer number (23889252240).
Almost surely, 21123543505150 is an apocalyptic number.
1123543505150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1123543505150 is an abundant number, since it is smaller than the sum of its proper divisors (1169824709890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123543505150 is a wasteful number, since it uses less digits than its factorization.
1123543505150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15410 (or 15405 counting only the distinct ones).
The product of its (nonzero) digits is 45000, while the sum is 35.
Adding to 1123543505150 its reverse (515053453211), we get a palindrome (1638596958361).
The spelling of 1123543505150 in words is "one trillion, one hundred twenty-three billion, five hundred forty-three million, five hundred five thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •