Base | Representation |
---|---|
bin | 11111111100000100110… |
… | …11110110100101101001 |
3 | 10212220121001010010000011 |
4 | 33332002123312211221 |
5 | 120434441140000131 |
6 | 2200050233411521 |
7 | 142166501410000 |
oct | 17760233664551 |
9 | 3786531103004 |
10 | 1097405000041 |
11 | 393452571129 |
12 | 158826869ba1 |
13 | 7c63c29613c |
14 | 3b1869a7c37 |
15 | 1d82cc5c0b1 |
hex | ff826f6969 |
1097405000041 has 15 divisors (see below), whose sum is σ = 1280289541821. Its totient is φ = 940588859196.
The previous prime is 1097405000017. The next prime is 1097405000047. The reversal of 1097405000041 is 1400005047901.
The square root of 1097405000041 is 1047571.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 1097405000041 - 25 = 1097405000009 is a prime.
It is a super-2 number, since 2×10974050000412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1097404999967 and 1097405000012.
It is not an unprimeable number, because it can be changed into a prime (1097405000047) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 51320290 + ... + 51341668.
Almost surely, 21097405000041 is an apocalyptic number.
1097405000041 is the 1047571-st square number.
1097405000041 is the 523786-th centered octagonal number.
It is an amenable number.
1097405000041 is a deficient number, since it is larger than the sum of its proper divisors (182884541780).
1097405000041 is an frugal number, since it uses more digits than its factorization.
1097405000041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42786 (or 21386 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 31.
The spelling of 1097405000041 in words is "one trillion, ninety-seven billion, four hundred five million, forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •