Base | Representation |
---|---|
bin | 100001110101000… |
… | …0101000000011010 |
3 | 2221002220020222212 |
4 | 1003222011000122 |
5 | 4311041312101 |
6 | 304345115122 |
7 | 40062140120 |
oct | 10352050032 |
9 | 2832806885 |
10 | 1135104026 |
11 | 532811501 |
12 | 278188aa2 |
13 | 151221bb4 |
14 | aaa79910 |
15 | 699bc1bb |
hex | 43a8501a |
1135104026 has 8 divisors (see below), whose sum is σ = 1945892640. Its totient is φ = 486473148.
The previous prime is 1135104011. The next prime is 1135104041. The reversal of 1135104026 is 6204015311.
It is an interprime number because it is at equal distance from previous prime (1135104011) and next prime (1135104041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11351040262 = 2576922299682817352, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1135103992 and 1135104010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40539416 + ... + 40539443.
It is an arithmetic number, because the mean of its divisors is an integer number (243236580).
Almost surely, 21135104026 is an apocalyptic number.
1135104026 is a deficient number, since it is larger than the sum of its proper divisors (810788614).
1135104026 is an equidigital number, since it uses as much as digits as its factorization.
1135104026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81078868.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 1135104026 is about 33691.3049020070. The cubic root of 1135104026 is about 1043.1462984986.
Adding to 1135104026 its reverse (6204015311), we get a palindrome (7339119337).
The spelling of 1135104026 in words is "one billion, one hundred thirty-five million, one hundred four thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •