Base | Representation |
---|---|
bin | 10011010110110001111… |
… | …111000101101011110001 |
3 | 11201011022010010211212221 |
4 | 103112301333011223301 |
5 | 133243102014000144 |
6 | 2455015335321041 |
7 | 165045612644515 |
oct | 23266177055361 |
9 | 4634263124787 |
10 | 1330131000049 |
11 | 473118300525 |
12 | 195956220181 |
13 | 9857a668257 |
14 | 48543174145 |
15 | 248ee2c8d84 |
hex | 135b1fc5af1 |
1330131000049 has 2 divisors, whose sum is σ = 1330131000050. Its totient is φ = 1330131000048.
The previous prime is 1330131000047. The next prime is 1330131000073. The reversal of 1330131000049 is 9400001310331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1239062849424 + 91068150625 = 1113132^2 + 301775^2 .
It is an emirp because it is prime and its reverse (9400001310331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1330131000049 - 21 = 1330131000047 is a prime.
Together with 1330131000047, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1330130999987 and 1330131000032.
It is not a weakly prime, because it can be changed into another prime (1330131000043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665065500024 + 665065500025.
It is an arithmetic number, because the mean of its divisors is an integer number (665065500025).
Almost surely, 21330131000049 is an apocalyptic number.
It is an amenable number.
1330131000049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330131000049 is an equidigital number, since it uses as much as digits as its factorization.
1330131000049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
The spelling of 1330131000049 in words is "one trillion, three hundred thirty billion, one hundred thirty-one million, forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •