Base | Representation |
---|---|
bin | 10000101001010110010… |
… | …101001001011100111010 |
3 | 11001100122000212212212020 |
4 | 100221112111021130322 |
5 | 122220211334410200 |
6 | 2233301014255310 |
7 | 145434101615016 |
oct | 20512625113472 |
9 | 4040560785766 |
10 | 1143909685050 |
11 | 401147217300 |
12 | 165845057536 |
13 | 83b40b49b32 |
14 | 3d518dd9546 |
15 | 1eb5081cea0 |
hex | 10a5654973a |
1143909685050 has 144 divisors (see below), whose sum is σ = 3125087023296. Its totient is φ = 276702624000.
The previous prime is 1143909685021. The next prime is 1143909685067. The reversal of 1143909685050 is 505869093411.
It is a junction number, because it is equal to n+sod(n) for n = 1143909684984 and 1143909685002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8225595 + ... + 8363505.
Almost surely, 21143909685050 is an apocalyptic number.
1143909685050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1143909685050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1562543511648).
1143909685050 is an abundant number, since it is smaller than the sum of its proper divisors (1981177338246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1143909685050 is a wasteful number, since it uses less digits than its factorization.
1143909685050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138405 (or 138389 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 51.
The spelling of 1143909685050 in words is "one trillion, one hundred forty-three billion, nine hundred nine million, six hundred eighty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •