Base | Representation |
---|---|
bin | 10000010111001000000… |
… | …001100101000010011110 |
3 | 10222111010100102210222200 |
4 | 100113020001211002132 |
5 | 121410123113240220 |
6 | 2220303221552330 |
7 | 144142152021225 |
oct | 20271001450236 |
9 | 3874110383880 |
10 | 1124342321310 |
11 | 3a3915a2430a |
12 | 161aa3b756a6 |
13 | 82042c9c6b0 |
14 | 3c5c0371cbc |
15 | 1e3a7a60890 |
hex | 105c806509e |
1124342321310 has 96 divisors (see below), whose sum is σ = 3183531361920. Its totient is φ = 273651485184.
The previous prime is 1124342321281. The next prime is 1124342321321. The reversal of 1124342321310 is 131232434211.
1124342321310 is a `hidden beast` number, since 1 + 1 + 2 + 4 + 342 + 3 + 2 + 1 + 310 = 666.
It is a super-2 number, since 2×11243423213102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5294614 + ... + 5502873.
It is an arithmetic number, because the mean of its divisors is an integer number (33161785020).
Almost surely, 21124342321310 is an apocalyptic number.
1124342321310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1124342321310 is an abundant number, since it is smaller than the sum of its proper divisors (2059189040610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1124342321310 is a wasteful number, since it uses less digits than its factorization.
1124342321310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10797602 (or 10797599 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 1124342321310 its reverse (131232434211), we get a palindrome (1255574755521).
The spelling of 1124342321310 in words is "one trillion, one hundred twenty-four billion, three hundred forty-two million, three hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •