Base | Representation |
---|---|
bin | 11001101100100100101000… |
… | …100110100010110100110101 |
3 | 112211011001021211011201002121 |
4 | 121230210220212202310311 |
5 | 104303110442321334110 |
6 | 1040205553020035541 |
7 | 32543001063033400 |
oct | 3154445046426465 |
9 | 484131254151077 |
10 | 113014155652405 |
11 | 33012041658057 |
12 | 10812a98092bb1 |
13 | 4b0a25c73ab37 |
14 | 1dc9cb2c6ad37 |
15 | d0eb56a83cda |
hex | 66c9289a2d35 |
113014155652405 has 24 divisors (see below), whose sum is σ = 167038449513048. Its totient is φ = 72936866838528.
The previous prime is 113014155652379. The next prime is 113014155652457. The reversal of 113014155652405 is 504256551410311.
It can be written as a sum of positive squares in 4 ways, for example, as 13458640634404 + 99555515018001 = 3668602^2 + 9977751^2 .
It is not a de Polignac number, because 113014155652405 - 229 = 113013618781493 is a prime.
It is a super-2 number, since 2×1130141556524052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13567121364 + ... + 13567129693.
It is an arithmetic number, because the mean of its divisors is an integer number (6959935396377).
Almost surely, 2113014155652405 is an apocalyptic number.
It is an amenable number.
113014155652405 is a deficient number, since it is larger than the sum of its proper divisors (54024293860643).
113014155652405 is a wasteful number, since it uses less digits than its factorization.
113014155652405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27134251093 (or 27134251086 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 43.
The spelling of 113014155652405 in words is "one hundred thirteen trillion, fourteen billion, one hundred fifty-five million, six hundred fifty-two thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •