Base | Representation |
---|---|
bin | 10000010111001101111… |
… | …011010011100010000000 |
3 | 10222111101020202111010202 |
4 | 100113031323103202000 |
5 | 121410323440340112 |
6 | 2220321120144332 |
7 | 144144463455443 |
oct | 20271573234200 |
9 | 3874336674122 |
10 | 1124441340032 |
11 | 3a396690556a |
12 | 161b111680a8 |
13 | 8205a65b65a |
14 | 3c5cd58965a |
15 | 1e3b15be6c2 |
hex | 105cded3880 |
1124441340032 has 16 divisors (see below), whose sum is σ = 2240097982350. Its totient is φ = 562220669952.
The previous prime is 1124441340031. The next prime is 1124441340037. The reversal of 1124441340032 is 2300431444211.
It can be written as a sum of positive squares in only one way, i.e., 1076065976896 + 48375363136 = 1037336^2 + 219944^2 .
It is a tau number, because it is divible by the number of its divisors (16).
It is a super-2 number, since 2×11244413400322 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1124441339977 and 1124441340004.
It is not an unprimeable number, because it can be changed into a prime (1124441340031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4392348857 + ... + 4392349112.
Almost surely, 21124441340032 is an apocalyptic number.
It is an amenable number.
1124441340032 is a deficient number, since it is larger than the sum of its proper divisors (1115656642318).
1124441340032 is an frugal number, since it uses more digits than its factorization.
1124441340032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8784697983 (or 8784697971 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 1124441340032 its reverse (2300431444211), we get a palindrome (3424872784243).
The spelling of 1124441340032 in words is "one trillion, one hundred twenty-four billion, four hundred forty-one million, three hundred forty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •