Base | Representation |
---|---|
bin | 10000100001010000100… |
… | …101100000111011101000 |
3 | 11000112012200001202011222 |
4 | 100201100211200323220 |
5 | 122044414141041030 |
6 | 2225303040441212 |
7 | 145005615332432 |
oct | 20412045407350 |
9 | 4015180052158 |
10 | 1135223377640 |
11 | 3a849a001a50 |
12 | 164020019208 |
13 | 8308837cb71 |
14 | 3cd3351d652 |
15 | 1e7e2e573e5 |
hex | 10850960ee8 |
1135223377640 has 32 divisors (see below), whose sum is σ = 2786457382560. Its totient is φ = 412808500800.
The previous prime is 1135223377573. The next prime is 1135223377643. The reversal of 1135223377640 is 467733225311.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a junction number, because it is equal to n+sod(n) for n = 1135223377591 and 1135223377600.
It is not an unprimeable number, because it can be changed into a prime (1135223377643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1290026126 + ... + 1290027005.
It is an arithmetic number, because the mean of its divisors is an integer number (87076793205).
Almost surely, 21135223377640 is an apocalyptic number.
1135223377640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1135223377640 is an abundant number, since it is smaller than the sum of its proper divisors (1651234004920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1135223377640 is a wasteful number, since it uses less digits than its factorization.
1135223377640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2580053153 (or 2580053149 counting only the distinct ones).
The product of its (nonzero) digits is 635040, while the sum is 44.
The spelling of 1135223377640 in words is "one trillion, one hundred thirty-five billion, two hundred twenty-three million, three hundred seventy-seven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •