Base | Representation |
---|---|
bin | 11110010011010000110… |
… | …11001011100010011000 |
3 | 10200112100102101020002221 |
4 | 33021220123023202120 |
5 | 114024220303304430 |
6 | 2114142415433424 |
7 | 135135162222346 |
oct | 17115033134230 |
9 | 3615312336087 |
10 | 1041134041240 |
11 | 3715a70299a7 |
12 | 149941825874 |
13 | 7724228a307 |
14 | 38569494996 |
15 | 1c137aaa57a |
hex | f2686cb898 |
1041134041240 has 32 divisors (see below), whose sum is σ = 2349502814880. Its totient is φ = 415217843712.
The previous prime is 1041134041141. The next prime is 1041134041243. The reversal of 1041134041240 is 421404311401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1041134041243) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 38604252 + ... + 38631211.
It is an arithmetic number, because the mean of its divisors is an integer number (73421962965).
Almost surely, 21041134041240 is an apocalyptic number.
1041134041240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1041134041240 is an abundant number, since it is smaller than the sum of its proper divisors (1308368773640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1041134041240 is a wasteful number, since it uses less digits than its factorization.
1041134041240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77235811 (or 77235807 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 1041134041240 its reverse (421404311401), we get a palindrome (1462538352641).
The spelling of 1041134041240 in words is "one trillion, forty-one billion, one hundred thirty-four million, forty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •