Base | Representation |
---|---|
bin | 100000111100000… |
… | …1000010011101010 |
3 | 2212000200122211101 |
4 | 1001320020103222 |
5 | 4230414430010 |
6 | 301400552014 |
7 | 36250220011 |
oct | 10170102352 |
9 | 2760618741 |
10 | 1105233130 |
11 | 51796a011 |
12 | 26a18260a |
13 | 147c93901 |
14 | a6b01a78 |
15 | 6706b73a |
hex | 41e084ea |
1105233130 has 8 divisors (see below), whose sum is σ = 1989419652. Its totient is φ = 442093248.
The previous prime is 1105233113. The next prime is 1105233131. The reversal of 1105233130 is 313325011.
It can be written as a sum of positive squares in 2 ways, for example, as 995465601 + 109767529 = 31551^2 + 10477^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×11052331303 (a number of 28 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1105233098 and 1105233107.
It is not an unprimeable number, because it can be changed into a prime (1105233131) 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, 55261647 + ... + 55261666.
Almost surely, 21105233130 is an apocalyptic number.
1105233130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1105233130 is a deficient number, since it is larger than the sum of its proper divisors (884186522).
1105233130 is a wasteful number, since it uses less digits than its factorization.
1105233130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110523320.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 1105233130 is about 33245.0466987189. The cubic root of 1105233130 is about 1033.9145130462.
Adding to 1105233130 its reverse (313325011), we get a palindrome (1418558141).
The spelling of 1105233130 in words is "one billion, one hundred five million, two hundred thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •