Base | Representation |
---|---|
bin | 1011100000111011001101… |
… | …0101111111000001000010 |
3 | 1122211022101111200201212010 |
4 | 2320032303111333001002 |
5 | 3124411222020143424 |
6 | 42532015020313350 |
7 | 2444450323140660 |
oct | 270166325770102 |
9 | 48738344621763 |
10 | 12660277506114 |
11 | 4041214665957 |
12 | 15057913a2856 |
13 | 70ab2242a774 |
14 | 31aa91511c30 |
15 | 16e4c9a5a229 |
hex | b83b357f042 |
12660277506114 has 64 divisors (see below), whose sum is σ = 30762071488512. Its totient is φ = 3390880800000.
The previous prime is 12660277506113. The next prime is 12660277506119. The reversal of 12660277506114 is 41160577206621.
12660277506114 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×126602775061142 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12660277506113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35142462 + ... + 35500889.
It is an arithmetic number, because the mean of its divisors is an integer number (480657367008).
Almost surely, 212660277506114 is an apocalyptic number.
12660277506114 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
12660277506114 is an abundant number, since it is smaller than the sum of its proper divisors (18101793982398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12660277506114 is a wasteful number, since it uses less digits than its factorization.
12660277506114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70643631.
The product of its (nonzero) digits is 846720, while the sum is 48.
The spelling of 12660277506114 in words is "twelve trillion, six hundred sixty billion, two hundred seventy-seven million, five hundred six thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •