Base | Representation |
---|---|
bin | 11001110001000101100001… |
… | …110001101010011111101111 |
3 | 112212020200221222021222100102 |
4 | 121301011201301222133233 |
5 | 104323201233220422111 |
6 | 1041004253331221315 |
7 | 32604262045614431 |
oct | 3161054161523757 |
9 | 485220858258312 |
10 | 113324352514031 |
11 | 331216516a841a |
12 | 1086302844783b |
13 | 4b30595c82879 |
14 | 1ddacdc338651 |
15 | d17c5e53a13b |
hex | 671161c6a7ef |
113324352514031 has 4 divisors (see below), whose sum is σ = 113452984016064. Its totient is φ = 113195721012000.
The previous prime is 113324352514027. The next prime is 113324352514049. The reversal of 113324352514031 is 130415253423311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 113324352514031 - 22 = 113324352514027 is a prime.
It is a super-2 number, since 2×1133243525140312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113324352514631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64315749695 + ... + 64315751456.
It is an arithmetic number, because the mean of its divisors is an integer number (28363246004016).
Almost surely, 2113324352514031 is an apocalyptic number.
113324352514031 is a deficient number, since it is larger than the sum of its proper divisors (128631502033).
113324352514031 is an equidigital number, since it uses as much as digits as its factorization.
113324352514031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128631502032.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 113324352514031 in words is "one hundred thirteen trillion, three hundred twenty-four billion, three hundred fifty-two million, five hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •