Base | Representation |
---|---|
bin | 100001110001101… |
… | …1000110111011001 |
3 | 2220222121011102022 |
4 | 1003203120313121 |
5 | 4310114202421 |
6 | 304243344225 |
7 | 40041214313 |
oct | 10343306731 |
9 | 2828534368 |
10 | 1133350361 |
11 | 5318239a0 |
12 | 277682075 |
13 | 150a59920 |
14 | aa7407b3 |
15 | 697727ab |
hex | 438d8dd9 |
1133350361 has 16 divisors (see below), whose sum is σ = 1401570240. Its totient is φ = 901005120.
The previous prime is 1133350349. The next prime is 1133350381. The reversal of 1133350361 is 1630533311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1133350361 - 210 = 1133349337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1133350361.
It is not an unprimeable number, because it can be changed into a prime (1133350301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 205850 + ... + 211283.
It is an arithmetic number, because the mean of its divisors is an integer number (87598140).
Almost surely, 21133350361 is an apocalyptic number.
1133350361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1133350361 is a deficient number, since it is larger than the sum of its proper divisors (268219879).
1133350361 is a wasteful number, since it uses less digits than its factorization.
1133350361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 417176.
The product of its (nonzero) digits is 2430, while the sum is 26.
The square root of 1133350361 is about 33665.2693587917. The cubic root of 1133350361 is about 1042.6088229346.
Adding to 1133350361 its reverse (1630533311), we get a palindrome (2763883672).
The spelling of 1133350361 in words is "one billion, one hundred thirty-three million, three hundred fifty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •