Base | Representation |
---|---|
bin | 10011010110110110110… |
… | …000101010000111110111 |
3 | 11201011111200212111210011 |
4 | 103112312300222013313 |
5 | 133243233020300343 |
6 | 2455031320241051 |
7 | 165050604550462 |
oct | 23266660520767 |
9 | 4634450774704 |
10 | 1330211103223 |
11 | 4731595421a2 |
12 | 195979010187 |
13 | 98591133592 |
14 | 4854da662d9 |
15 | 2490634d29d |
hex | 135b6c2a1f7 |
1330211103223 has 16 divisors (see below), whose sum is σ = 1378405838880. Its totient is φ = 1282172685696.
The previous prime is 1330211103203. The next prime is 1330211103241. The reversal of 1330211103223 is 3223011120331.
It is a cyclic number.
It is not a de Polignac number, because 1330211103223 - 233 = 1321621168631 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330211103194 and 1330211103203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330211103203) 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 15 ways as a sum of consecutive naturals, for example, 69427761 + ... + 69446917.
It is an arithmetic number, because the mean of its divisors is an integer number (86150364930).
Almost surely, 21330211103223 is an apocalyptic number.
1330211103223 is a deficient number, since it is larger than the sum of its proper divisors (48194735657).
1330211103223 is a wasteful number, since it uses less digits than its factorization.
1330211103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23106.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 1330211103223 its reverse (3223011120331), we get a palindrome (4553222223554).
The spelling of 1330211103223 in words is "one trillion, three hundred thirty billion, two hundred eleven million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •