Base | Representation |
---|---|
bin | 11001110011000111111000… |
… | …001111000011001110011001 |
3 | 112212202002020020211012221121 |
4 | 121303013320033003032121 |
5 | 104332444404313101434 |
6 | 1041152442001205241 |
7 | 32620345342540000 |
oct | 3163077017031631 |
9 | 485662206735847 |
10 | 113464315753369 |
11 | 33175a45263749 |
12 | 10886189930821 |
13 | 4b40840043599 |
14 | 20039b8b17c37 |
15 | d1b701de97b4 |
hex | 6731f83c3399 |
113464315753369 has 15 divisors (see below), whose sum is σ = 132367767764757. Its totient is φ = 97254680406156.
The previous prime is 113464315753363. The next prime is 113464315753511. The reversal of 113464315753369 is 963357513464311.
The square root of 113464315753369 is 10651963.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 113464315753369 - 23 = 113464315753361 is a prime.
It is a super-2 number, since 2×1134643157533692 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113464315753361) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 521837494 + ... + 522054880.
Almost surely, 2113464315753369 is an apocalyptic number.
113464315753369 is the 10651963-rd square number.
113464315753369 is the 5325982-nd centered octagonal number.
It is an amenable number.
113464315753369 is a deficient number, since it is larger than the sum of its proper divisors (18903452011388).
113464315753369 is an frugal number, since it uses more digits than its factorization.
113464315753369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434802 (or 217394 counting only the distinct ones).
The product of its digits is 73483200, while the sum is 61.
The spelling of 113464315753369 in words is "one hundred thirteen trillion, four hundred sixty-four billion, three hundred fifteen million, seven hundred fifty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •