Base | Representation |
---|---|
bin | 10011010110101011011… |
… | …011111011110100100001 |
3 | 11201011000110101102121010 |
4 | 103112223123323310201 |
5 | 133242340401340223 |
6 | 2455000412251133 |
7 | 165043106666403 |
oct | 23265333736441 |
9 | 4634013342533 |
10 | 1330021121313 |
11 | 473071281a55 |
12 | 195925470aa9 |
13 | 98560976151 |
14 | 48532730b73 |
15 | 248e4822393 |
hex | 135ab6fbd21 |
1330021121313 has 8 divisors (see below), whose sum is σ = 1776312182176. Its totient is φ = 885205404000.
The previous prime is 1330021121311. The next prime is 1330021121339. The reversal of 1330021121313 is 3131211200331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1330021121313 - 21 = 1330021121311 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1330021121313.
It is not an unprimeable number, because it can be changed into a prime (1330021121311) 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, 368833783 + ... + 368837388.
It is an arithmetic number, because the mean of its divisors is an integer number (222039022772).
Almost surely, 21330021121313 is an apocalyptic number.
It is an amenable number.
1330021121313 is a deficient number, since it is larger than the sum of its proper divisors (446291060863).
1330021121313 is an equidigital number, since it uses as much as digits as its factorization.
1330021121313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 737671775.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1330021121313 its reverse (3131211200331), we get a palindrome (4461232321644).
The spelling of 1330021121313 in words is "one trillion, three hundred thirty billion, twenty-one million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •