Base | Representation |
---|---|
bin | 10000001100110110000… |
… | …101110000111010110100 |
3 | 10221102122001220112002102 |
4 | 100030312011300322310 |
5 | 121220021311313140 |
6 | 2211240024401232 |
7 | 143301465643640 |
oct | 20146605607264 |
9 | 3842561815072 |
10 | 1113304010420 |
11 | 39a1710a9a28 |
12 | 15b923316218 |
13 | 80ca41502a4 |
14 | 3bc5436bc20 |
15 | 1de5d954e15 |
hex | 10336170eb4 |
1113304010420 has 48 divisors (see below), whose sum is σ = 2734067538048. Its totient is φ = 372827387520.
The previous prime is 1113304010387. The next prime is 1113304010431. The reversal of 1113304010420 is 240104033111.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1113304010392 and 1113304010401.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92461091 + ... + 92473130.
It is an arithmetic number, because the mean of its divisors is an integer number (56959740376).
Almost surely, 21113304010420 is an apocalyptic number.
1113304010420 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113304010420 is an abundant number, since it is smaller than the sum of its proper divisors (1620763527628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113304010420 is a wasteful number, since it uses less digits than its factorization.
1113304010420 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184934280 (or 184934278 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1113304010420 its reverse (240104033111), we get a palindrome (1353408043531).
The spelling of 1113304010420 in words is "one trillion, one hundred thirteen billion, three hundred four million, ten thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •