Base | Representation |
---|---|
bin | 10000001100110110011… |
… | …101000010111000100000 |
3 | 10221102122111101120200110 |
4 | 100030312131002320200 |
5 | 121220024342111222 |
6 | 2211240403251320 |
7 | 143301601552425 |
oct | 20146635027040 |
9 | 3842574346613 |
10 | 1113310113312 |
11 | 39a174598141 |
12 | 15b925379b40 |
13 | 80ca54a9077 |
14 | 3bc550b9d4c |
15 | 1de5e25d30c |
hex | 10336742e20 |
1113310113312 has 24 divisors (see below), whose sum is σ = 2922439047696. Its totient is φ = 371103371072.
The previous prime is 1113310113271. The next prime is 1113310113313. The reversal of 1113310113312 is 2133110133111.
It is a tau number, because it is divible by the number of its divisors (24).
It is not an unprimeable number, because it can be changed into a prime (1113310113313) 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, 5798490078 + ... + 5798490269.
It is an arithmetic number, because the mean of its divisors is an integer number (121768293654).
Almost surely, 21113310113312 is an apocalyptic number.
1113310113312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1113310113312 is an abundant number, since it is smaller than the sum of its proper divisors (1809128934384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113310113312 is a wasteful number, since it uses less digits than its factorization.
1113310113312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11596980360 (or 11596980352 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 1113310113312 its reverse (2133110133111), we get a palindrome (3246420246423).
The spelling of 1113310113312 in words is "one trillion, one hundred thirteen billion, three hundred ten million, one hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •