Base | Representation |
---|---|
bin | 11011010010001000011101… |
… | …100101011110111101000001 |
3 | 120201212020122212202221001011 |
4 | 123102020131211132331001 |
5 | 111211432230411243100 |
6 | 1103112054015440521 |
7 | 34163141440002301 |
oct | 3322103545367501 |
9 | 521766585687034 |
10 | 119993292681025 |
11 | 35262962555195 |
12 | 1155b606b26141 |
13 | 51c541b95b38a |
14 | 218b9c633d601 |
15 | dd147a8a1bba |
hex | 6d221d95ef41 |
119993292681025 has 9 divisors (see below), whose sum is σ = 148791750840201. Its totient is φ = 95994590328240.
The previous prime is 119993292680981. The next prime is 119993292681091. The reversal of 119993292681025 is 520186292399911.
The square root of 119993292681025 is 10954145.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 18995938215489 + 100997354465536 = 4358433^2 + 10049744^2 .
It is a de Polignac number, because none of the positive numbers 2k-119993292681025 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 53675311 + ... + 55866139.
Almost surely, 2119993292681025 is an apocalyptic number.
119993292681025 is the 10954145-th square number.
119993292681025 is the 5477073-rd centered octagonal number.
It is an amenable number.
119993292681025 is a deficient number, since it is larger than the sum of its proper divisors (28798458159176).
119993292681025 is an frugal number, since it uses more digits than its factorization.
119993292681025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4381668 (or 2190834 counting only the distinct ones).
The product of its (nonzero) digits is 37791360, while the sum is 67.
The spelling of 119993292681025 in words is "one hundred nineteen trillion, nine hundred ninety-three billion, two hundred ninety-two million, six hundred eighty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •