Base | Representation |
---|---|
bin | 10000010111000111010… |
… | …011110011000011110001 |
3 | 10222111002111212002102220 |
4 | 100113013103303003301 |
5 | 121410112030220423 |
6 | 2220302112431253 |
7 | 144141645015300 |
oct | 20270723630361 |
9 | 3874074762386 |
10 | 1124330320113 |
11 | 3a390a177670 |
12 | 161a9bb48529 |
13 | 82040659cb0 |
14 | 3c5bc92a437 |
15 | 1e3a698e9e3 |
hex | 105c74f30f1 |
1124330320113 has 96 divisors (see below), whose sum is σ = 2104102304640. Its totient is φ = 524567715840.
The previous prime is 1124330320021. The next prime is 1124330320117. The reversal of 1124330320113 is 3110230334211.
It is not a de Polignac number, because 1124330320113 - 216 = 1124330254577 is a prime.
It is a super-5 number, since 5×11243303201135 (a number of 61 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (1124330320117) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 54993 + ... + 1500561.
It is an arithmetic number, because the mean of its divisors is an integer number (21917732340).
Almost surely, 21124330320113 is an apocalyptic number.
1124330320113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1124330320113 is a deficient number, since it is larger than the sum of its proper divisors (979771984527).
1124330320113 is a wasteful number, since it uses less digits than its factorization.
1124330320113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1445647 (or 1445640 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1124330320113 its reverse (3110230334211), we get a palindrome (4234560654324).
The spelling of 1124330320113 in words is "one trillion, one hundred twenty-four billion, three hundred thirty million, three hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •