Base | Representation |
---|---|
bin | 110101100110110110… |
… | …0110000111111111010 |
3 | 102000010220222210120000 |
4 | 1223031230300333322 |
5 | 3341231233322020 |
6 | 124515133413430 |
7 | 11213533450044 |
oct | 1531554607772 |
9 | 360126883500 |
10 | 115120214010 |
11 | 449053a573a |
12 | 1a38963a276 |
13 | ab18228c39 |
14 | 5801218a94 |
15 | 2edb898090 |
hex | 1acdb30ffa |
115120214010 has 80 divisors (see below), whose sum is σ = 312736868136. Its totient is φ = 30382221312.
The previous prime is 115120213987. The next prime is 115120214051. The reversal of 115120214010 is 10412021511.
115120214010 is a `hidden beast` number, since 1 + 1 + 512 + 0 + 2 + 140 + 10 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 112193512209 + 2926701801 = 334953^2 + 54099^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 654027 + ... + 811166.
Almost surely, 2115120214010 is an apocalyptic number.
115120214010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115120214010 is an abundant number, since it is smaller than the sum of its proper divisors (197616654126).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115120214010 is a wasteful number, since it uses less digits than its factorization.
115120214010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1465309 (or 1465300 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 115120214010 its reverse (10412021511), we get a palindrome (125532235521).
The spelling of 115120214010 in words is "one hundred fifteen billion, one hundred twenty million, two hundred fourteen thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •