Base | Representation |
---|---|
bin | 10011010110110011000… |
… | …110010011010111101001 |
3 | 11201011100102021021221201 |
4 | 103112303012103113221 |
5 | 133243121303341304 |
6 | 2455021243404201 |
7 | 165046230426136 |
oct | 23266306232751 |
9 | 4634312237851 |
10 | 1330149668329 |
11 | 4731278a1259 |
12 | 195960523661 |
13 | 985814a3481 |
14 | 4854583358d |
15 | 24900c653a4 |
hex | 135b31935e9 |
1330149668329 has 4 divisors (see below), whose sum is σ = 1408393766484. Its totient is φ = 1251905570176.
The previous prime is 1330149668321. The next prime is 1330149668357. The reversal of 1330149668329 is 9238669410331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 641083658329 + 689066010000 = 800677^2 + 830100^2 .
It is not a de Polignac number, because 1330149668329 - 23 = 1330149668321 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 1330149668329.
It is not an unprimeable number, because it can be changed into a prime (1330149668321) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39122049052 + ... + 39122049085.
It is an arithmetic number, because the mean of its divisors is an integer number (352098441621).
Almost surely, 21330149668329 is an apocalyptic number.
It is an amenable number.
1330149668329 is a deficient number, since it is larger than the sum of its proper divisors (78244098155).
1330149668329 is an equidigital number, since it uses as much as digits as its factorization.
1330149668329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78244098154.
The product of its (nonzero) digits is 5038848, while the sum is 55.
The spelling of 1330149668329 in words is "one trillion, three hundred thirty billion, one hundred forty-nine million, six hundred sixty-eight thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •