Base | Representation |
---|---|
bin | 110100101001110010… |
… | …1011000111100011001 |
3 | 101210212010220022120100 |
4 | 1221103211120330121 |
5 | 3323032243210441 |
6 | 123535545450013 |
7 | 11112005360454 |
oct | 1512345307431 |
9 | 353763808510 |
10 | 113071460121 |
11 | 43a53989604 |
12 | 19ab74a0909 |
13 | a87c941729 |
14 | 56890ac49b |
15 | 2e1baa4cb6 |
hex | 1a53958f19 |
113071460121 has 9 divisors (see below), whose sum is σ = 163326899541. Its totient is φ = 75380300892.
The previous prime is 113071460119. The next prime is 113071460209. The reversal of 113071460121 is 121064170311.
The square root of 113071460121 is 336261.
It is a perfect power (a square), and thus also a powerful number.
113071460121 is a `hidden beast` number, since 1 + 1 + 30 + 7 + 1 + 4 + 601 + 21 = 666.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 113071460121 - 21 = 113071460119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113071461121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 952740 + ... + 1064826.
Almost surely, 2113071460121 is an apocalyptic number.
113071460121 is the 336261-st square number.
113071460121 is the 168131-st centered octagonal number.
It is an amenable number.
113071460121 is a deficient number, since it is larger than the sum of its proper divisors (50255439420).
113071460121 is an frugal number, since it uses more digits than its factorization.
113071460121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224180 (or 112090 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The spelling of 113071460121 in words is "one hundred thirteen billion, seventy-one million, four hundred sixty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •