Base | Representation |
---|---|
bin | 10011010110110001111… |
… | …111100001000100011111 |
3 | 11201011022010100112202112 |
4 | 103112301333201010133 |
5 | 133243102031042343 |
6 | 2455015341544235 |
7 | 165045613622534 |
oct | 23266177410437 |
9 | 4634263315675 |
10 | 1330131112223 |
11 | 473118377831 |
12 | 19595627507b |
13 | 9857a6a7324 |
14 | 485431a2d8b |
15 | 248ee2ec218 |
hex | 135b1fe111f |
1330131112223 has 4 divisors (see below), whose sum is σ = 1373038567488. Its totient is φ = 1287223656960.
The previous prime is 1330131112181. The next prime is 1330131112229. The reversal of 1330131112223 is 3222111310331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1330131112223 - 222 = 1330126917919 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330131112229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21453727586 + ... + 21453727647.
It is an arithmetic number, because the mean of its divisors is an integer number (343259641872).
Almost surely, 21330131112223 is an apocalyptic number.
1330131112223 is a deficient number, since it is larger than the sum of its proper divisors (42907455265).
1330131112223 is an equidigital number, since it uses as much as digits as its factorization.
1330131112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42907455264.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 1330131112223 its reverse (3222111310331), we get a palindrome (4552242422554).
The spelling of 1330131112223 in words is "one trillion, three hundred thirty billion, one hundred thirty-one million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •