Base | Representation |
---|---|
bin | 10011010110110111010… |
… | …011000001110110101011 |
3 | 11201011112022211021022120 |
4 | 103112313103001312223 |
5 | 133243242322111243 |
6 | 2455032241322323 |
7 | 165051044255133 |
oct | 23266723016653 |
9 | 4634468737276 |
10 | 1330220113323 |
11 | 473163636662 |
12 | 1959800363a3 |
13 | 98592c696ba |
14 | 48550d2dac3 |
15 | 2490702cc83 |
hex | 135b74c1dab |
1330220113323 has 12 divisors (see below), whose sum is σ = 1854093821160. Its totient is φ = 848256303136.
The previous prime is 1330220113307. The next prime is 1330220113429. The reversal of 1330220113323 is 3233110220331.
It is not a de Polignac number, because 1330220113323 - 24 = 1330220113307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1330220113293 and 1330220113302.
It is not an unprimeable number, because it can be changed into a prime (1330220113823) 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 11 ways as a sum of consecutive naturals, for example, 419097378 + ... + 419100551.
It is an arithmetic number, because the mean of its divisors is an integer number (154507818430).
Almost surely, 21330220113323 is an apocalyptic number.
1330220113323 is a deficient number, since it is larger than the sum of its proper divisors (523873707837).
1330220113323 is an equidigital number, since it uses as much as digits as its factorization.
1330220113323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838197978 (or 838197955 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 1330220113323 its reverse (3233110220331), we get a palindrome (4563330333654).
The spelling of 1330220113323 in words is "one trillion, three hundred thirty billion, two hundred twenty million, one hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •