Base | Representation |
---|---|
bin | 10000010111000111111… |
… | …001101010011001010001 |
3 | 10222111010012112101022221 |
4 | 100113013321222121101 |
5 | 121410122100333342 |
6 | 2220303105301041 |
7 | 144142125256105 |
oct | 20270771523121 |
9 | 3874105471287 |
10 | 1124340246097 |
11 | 3a3914837162 |
12 | 161aa3334781 |
13 | 82042723c63 |
14 | 3c5bdd91905 |
15 | 1e3a77a0a67 |
hex | 105c7e6a651 |
1124340246097 has 4 divisors (see below), whose sum is σ = 1136973282660. Its totient is φ = 1111707209536.
The previous prime is 1124340246059. The next prime is 1124340246181. The reversal of 1124340246097 is 7906420434211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 787521355776 + 336818890321 = 887424^2 + 580361^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124340246097 - 215 = 1124340213329 is a prime.
It is a super-3 number, since 3×11243402460973 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1124340246047) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6316518148 + ... + 6316518325.
It is an arithmetic number, because the mean of its divisors is an integer number (284243320665).
Almost surely, 21124340246097 is an apocalyptic number.
It is an amenable number.
1124340246097 is a deficient number, since it is larger than the sum of its proper divisors (12633036563).
1124340246097 is an equidigital number, since it uses as much as digits as its factorization.
1124340246097 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12633036562.
The product of its (nonzero) digits is 290304, while the sum is 43.
The spelling of 1124340246097 in words is "one trillion, one hundred twenty-four billion, three hundred forty million, two hundred forty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •