Base | Representation |
---|---|
bin | 11001000010101101111111… |
… | …111110100000000111010001 |
3 | 112102222002102010120222111101 |
4 | 121002231333332200013101 |
5 | 103414000102311242400 |
6 | 1030124410134344401 |
7 | 32125131102554521 |
oct | 3102557776400721 |
9 | 472862363528441 |
10 | 110137993462225 |
11 | 32103296021853 |
12 | 104295931bb101 |
13 | 495bc7823a3a1 |
14 | 1d2a9c8c91681 |
15 | caee1e1ce56a |
hex | 642b7ffa01d1 |
110137993462225 has 81 divisors (see below), whose sum is σ = 142658954056281. Its totient is φ = 84346881964800.
The previous prime is 110137993462219. The next prime is 110137993462241. The reversal of 110137993462225 is 522264399731011.
The square root of 110137993462225 is 10494665.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 40 ways, for example, as 83479524444369 + 26658469017856 = 9136713^2 + 5163184^2 .
It is not a de Polignac number, because 110137993462225 - 225 = 110137959907793 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 238911048495 + ... + 238911048955.
Almost surely, 2110137993462225 is an apocalyptic number.
110137993462225 is the 10494665-th square number.
110137993462225 is the 5247333-rd centered octagonal number.
It is an amenable number.
110137993462225 is a deficient number, since it is larger than the sum of its proper divisors (32520960594056).
110137993462225 is an frugal number, since it uses more digits than its factorization.
110137993462225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1304 (or 652 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 55.
The spelling of 110137993462225 in words is "one hundred ten trillion, one hundred thirty-seven billion, nine hundred ninety-three million, four hundred sixty-two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •