Base | Representation |
---|---|
bin | 10101101010000000… |
… | …11110010111000111 |
3 | 1010000021202100002120 |
4 | 22311000132113013 |
5 | 142302421010142 |
6 | 5201413141023 |
7 | 561056421504 |
oct | 126500362707 |
9 | 33007670076 |
10 | 11626735047 |
11 | 4a26a97144 |
12 | 230592a773 |
13 | 1133a240a5 |
14 | 7c42164ab |
15 | 480add7ec |
hex | 2b501e5c7 |
11626735047 has 8 divisors (see below), whose sum is σ = 16414214256. Its totient is φ = 7295206272.
The previous prime is 11626734989. The next prime is 11626735051. The reversal of 11626735047 is 74053762611.
It is a happy number.
11626735047 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11626735047 - 231 = 9479251399 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11626735147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 113987548 + ... + 113987649.
It is an arithmetic number, because the mean of its divisors is an integer number (2051776782).
Almost surely, 211626735047 is an apocalyptic number.
11626735047 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
11626735047 is a deficient number, since it is larger than the sum of its proper divisors (4787479209).
11626735047 is a wasteful number, since it uses less digits than its factorization.
11626735047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227975217.
The product of its (nonzero) digits is 211680, while the sum is 42.
The spelling of 11626735047 in words is "eleven billion, six hundred twenty-six million, seven hundred thirty-five thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •