Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …010000111100100110000 |
3 | 10221010002210220110001111 |
4 | 100021301022013210300 |
5 | 121141240002241430 |
6 | 2205532121043104 |
7 | 143123556444550 |
oct | 20116112074460 |
9 | 3833083813044 |
10 | 1110000040240 |
11 | 3988260a3263 |
12 | 15b160926494 |
13 | 808987aab50 |
14 | 3ba1d63b160 |
15 | 1dd1886ac2a |
hex | 10271287930 |
1110000040240 has 80 divisors (see below), whose sum is σ = 3176307828288. Its totient is φ = 351296713728.
The previous prime is 1110000040223. The next prime is 1110000040243. The reversal of 1110000040240 is 420400000111.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a self number, because there is not a number n which added to its sum of digits gives 1110000040240.
It is not an unprimeable number, because it can be changed into a prime (1110000040243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76228987 + ... + 76243546.
Almost surely, 21110000040240 is an apocalyptic number.
1110000040240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110000040240 is an abundant number, since it is smaller than the sum of its proper divisors (2066307788048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110000040240 is a wasteful number, since it uses less digits than its factorization.
1110000040240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152472566 (or 152472560 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1110000040240 its reverse (420400000111), we get a palindrome (1530400040351).
The spelling of 1110000040240 in words is "one trillion, one hundred ten billion, forty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •