Base | Representation |
---|---|
bin | 11110010011001111010… |
… | …10101010110100010001 |
3 | 10200112022112110010202100 |
4 | 33021213222222310101 |
5 | 114024204024334210 |
6 | 2114141243111013 |
7 | 135134646145626 |
oct | 17114752526421 |
9 | 3615275403670 |
10 | 1041121324305 |
11 | 37159a933537 |
12 | 149939512469 |
13 | 7723c756bba |
14 | 3856790434d |
15 | 1c1368e75c0 |
hex | f267aaad11 |
1041121324305 has 24 divisors (see below), whose sum is σ = 1883071614528. Its totient is φ = 531122762016.
The previous prime is 1041121324237. The next prime is 1041121324379. The reversal of 1041121324305 is 5034231211401.
1041121324305 is a `hidden beast` number, since 1 + 0 + 4 + 11 + 21 + 324 + 305 = 666.
It is not a de Polignac number, because 1041121324305 - 221 = 1041119227153 is a prime.
It is a super-2 number, since 2×10411213243052 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 502956127 + ... + 502958196.
It is an arithmetic number, because the mean of its divisors is an integer number (78461317272).
Almost surely, 21041121324305 is an apocalyptic number.
1041121324305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1041121324305 is a deficient number, since it is larger than the sum of its proper divisors (841950290223).
1041121324305 is a wasteful number, since it uses less digits than its factorization.
1041121324305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005914357 (or 1005914354 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1041121324305 its reverse (5034231211401), we get a palindrome (6075352535706).
The spelling of 1041121324305 in words is "one trillion, forty-one billion, one hundred twenty-one million, three hundred twenty-four thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •