Base | Representation |
---|---|
bin | 10011111010101011101… |
… | …100101010001010110000 |
3 | 11211211210200021200010010 |
4 | 103322223230222022300 |
5 | 134411024113223440 |
6 | 2524432450534520 |
7 | 200612112561135 |
oct | 23725354521260 |
9 | 4754720250103 |
10 | 1368680211120 |
11 | 4884aa330352 |
12 | 1a1314297440 |
13 | 9c0b1c98811 |
14 | 4a35cbac58c |
15 | 25908737580 |
hex | 13eabb2a2b0 |
1368680211120 has 80 divisors (see below), whose sum is σ = 4314822405120. Its totient is φ = 358795260672.
The previous prime is 1368680211103. The next prime is 1368680211127. The reversal of 1368680211120 is 211120868631.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×13686802111202 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1368680211127) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48314944 + ... + 48343263.
It is an arithmetic number, because the mean of its divisors is an integer number (53935280064).
Almost surely, 21368680211120 is an apocalyptic number.
1368680211120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1368680211120 is an abundant number, since it is smaller than the sum of its proper divisors (2946142194000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1368680211120 is a wasteful number, since it uses less digits than its factorization.
1368680211120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96658282 (or 96658276 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 39.
The spelling of 1368680211120 in words is "one trillion, three hundred sixty-eight billion, six hundred eighty million, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •