Base | Representation |
---|---|
bin | 10011010110101100001… |
… | …010100000101110011101 |
3 | 11201011001022100202021111 |
4 | 103112230022200232131 |
5 | 133242402013043401 |
6 | 2455001530102021 |
7 | 165043315531426 |
oct | 23265412405635 |
9 | 4634038322244 |
10 | 1330033331101 |
11 | 473078161392 |
12 | 19592957a911 |
13 | 9856335c787 |
14 | 485341cc64d |
15 | 248e5934e51 |
hex | 135ac2a0b9d |
1330033331101 has 8 divisors (see below), whose sum is σ = 1338620046840. Its totient is φ = 1321456945152.
The previous prime is 1330033331089. The next prime is 1330033331191. The reversal of 1330033331101 is 1011333300331.
It can be written as a sum of positive squares in 4 ways, for example, as 275232439876 + 1054800891225 = 524626^2 + 1027035^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1330033331101 - 27 = 1330033330973 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 (1330033331191) 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, 2324020 + ... + 2839213.
It is an arithmetic number, because the mean of its divisors is an integer number (167327505855).
Almost surely, 21330033331101 is an apocalyptic number.
It is an amenable number.
1330033331101 is a deficient number, since it is larger than the sum of its proper divisors (8586715739).
1330033331101 is a wasteful number, since it uses less digits than its factorization.
1330033331101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5164895.
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 1330033331101 its reverse (1011333300331), we get a palindrome (2341366631432).
The spelling of 1330033331101 in words is "one trillion, three hundred thirty billion, thirty-three million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •