Base | Representation |
---|---|
bin | 10011010010111000011… |
… | …001011000111000000001 |
3 | 11200202111021210101201201 |
4 | 103102320121120320001 |
5 | 133211013024343101 |
6 | 2453044032501201 |
7 | 164540055362233 |
oct | 23227031307001 |
9 | 4622437711651 |
10 | 1325943590401 |
11 | 4713696536a1 |
12 | 194b879aa801 |
13 | 98060c7a171 |
14 | 48266d98253 |
15 | 24756884e01 |
hex | 134b8658e01 |
1325943590401 has 4 divisors (see below), whose sum is σ = 1325977634052. Its totient is φ = 1325909546752.
The previous prime is 1325943590333. The next prime is 1325943590437. The reversal of 1325943590401 is 1040953495231.
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 993458732176 + 332484858225 = 996724^2 + 576615^2 .
It is a cyclic number.
It is not a de Polignac number, because 1325943590401 - 211 = 1325943588353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1325943590471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16963336 + ... + 17041321.
It is an arithmetic number, because the mean of its divisors is an integer number (331494408513).
Almost surely, 21325943590401 is an apocalyptic number.
It is an amenable number.
1325943590401 is a deficient number, since it is larger than the sum of its proper divisors (34043651).
1325943590401 is an equidigital number, since it uses as much as digits as its factorization.
1325943590401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34043650.
The product of its (nonzero) digits is 583200, while the sum is 46.
The spelling of 1325943590401 in words is "one trillion, three hundred twenty-five billion, nine hundred forty-three million, five hundred ninety thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •