Base | Representation |
---|---|
bin | 10011010110110000110… |
… | …111011111001011110101 |
3 | 11201011020210211020101212 |
4 | 103112300313133023311 |
5 | 133243032212331013 |
6 | 2455013425131205 |
7 | 165045264260651 |
oct | 23266067371365 |
9 | 4634223736355 |
10 | 1330112230133 |
11 | 4731087503a5 |
12 | 19594ba89b05 |
13 | 985767c59ab |
14 | 48540889a61 |
15 | 248ec81c6a8 |
hex | 135b0ddf2f5 |
1330112230133 has 8 divisors (see below), whose sum is σ = 1355869491360. Its totient is φ = 1304462068560.
The previous prime is 1330112230129. The next prime is 1330112230193. The reversal of 1330112230133 is 3310322110331.
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 1330112230133 - 22 = 1330112230129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330112230099 and 1330112230108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330112230193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26749835 + ... + 26799512.
It is an arithmetic number, because the mean of its divisors is an integer number (169483686420).
Almost surely, 21330112230133 is an apocalyptic number.
It is an amenable number.
1330112230133 is a deficient number, since it is larger than the sum of its proper divisors (25757261227).
1330112230133 is an equidigital number, since it uses as much as digits as its factorization.
1330112230133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53549827.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 1330112230133 its reverse (3310322110331), we get a palindrome (4640434340464).
The spelling of 1330112230133 in words is "one trillion, three hundred thirty billion, one hundred twelve million, two hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •