Base | Representation |
---|---|
bin | 10000100000001000100… |
… | …000111000000110000000 |
3 | 11000102002101210021100220 |
4 | 100200020200320012000 |
5 | 122034430113432430 |
6 | 2224543043543040 |
7 | 144633633450633 |
oct | 20401040700600 |
9 | 4012071707326 |
10 | 1134014202240 |
11 | 3a7a294a9637 |
12 | 16394308aa80 |
13 | 82c249c526a |
14 | 3cc5aac1c1a |
15 | 1e771c08110 |
hex | 10808838180 |
1134014202240 has 64 divisors (see below), whose sum is σ = 3614670275760. Its totient is φ = 302403786752.
The previous prime is 1134014202197. The next prime is 1134014202253. The reversal of 1134014202240 is 422024104311.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 1134014202240.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295314279 + ... + 295318118.
Almost surely, 21134014202240 is an apocalyptic number.
1134014202240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1134014202240 is an abundant number, since it is smaller than the sum of its proper divisors (2480656073520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1134014202240 is an equidigital number, since it uses as much as digits as its factorization.
1134014202240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590632419 (or 590632407 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 1134014202240 its reverse (422024104311), we get a palindrome (1556038306551).
The spelling of 1134014202240 in words is "one trillion, one hundred thirty-four billion, fourteen million, two hundred two thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •