Base | Representation |
---|---|
bin | 110100101111100001… |
… | …1110010000001100111 |
3 | 101211100120011011110111 |
4 | 1221133003302001213 |
5 | 3323431034222201 |
6 | 124011024033451 |
7 | 11116533626035 |
oct | 1513703620147 |
9 | 354316134414 |
10 | 113263976551 |
11 | 4404261aaa0 |
12 | 19b4ba62887 |
13 | a8b07a868b |
14 | 56a68a3555 |
15 | 2e2d931b51 |
hex | 1a5f0f2067 |
113263976551 has 8 divisors (see below), whose sum is σ = 123563145600. Its totient is φ = 102965214840.
The previous prime is 113263976513. The next prime is 113263976557. The reversal of 113263976551 is 155679362311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113263976551 - 213 = 113263968359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 113263976495 and 113263976504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113263976557) 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 7 ways as a sum of consecutive naturals, for example, 971340 + ... + 1081678.
It is an arithmetic number, because the mean of its divisors is an integer number (15445393200).
Almost surely, 2113263976551 is an apocalyptic number.
113263976551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113263976551 is a deficient number, since it is larger than the sum of its proper divisors (10299169049).
113263976551 is a wasteful number, since it uses less digits than its factorization.
113263976551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203669.
The product of its digits is 1020600, while the sum is 49.
The spelling of 113263976551 in words is "one hundred thirteen billion, two hundred sixty-three million, nine hundred seventy-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •