Base | Representation |
---|---|
bin | 10100000101001111111… |
… | …010100101100000101001 |
3 | 11212221002022222212112101 |
4 | 110011033322211200221 |
5 | 140102242431310243 |
6 | 2533550322413401 |
7 | 201463212110455 |
oct | 24051772454051 |
9 | 4787068885471 |
10 | 1380025260073 |
11 | 4922a1311569 |
12 | 1a355b801261 |
13 | a019c534935 |
14 | 4ab1781b665 |
15 | 25d6e73354d |
hex | 1414fea5829 |
1380025260073 has 8 divisors (see below), whose sum is σ = 1392265763208. Its totient is φ = 1367785246464.
The previous prime is 1380025260071. The next prime is 1380025260077. The reversal of 1380025260073 is 3700625200831.
It can be written as a sum of positive squares in 4 ways, for example, as 18724364569 + 1361300895504 = 136837^2 + 1166748^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 1380025260073 - 21 = 1380025260071 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1380025260071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7808715 + ... + 7983487.
It is an arithmetic number, because the mean of its divisors is an integer number (174033220401).
Almost surely, 21380025260073 is an apocalyptic number.
It is an amenable number.
1380025260073 is a deficient number, since it is larger than the sum of its proper divisors (12240503135).
1380025260073 is a wasteful number, since it uses less digits than its factorization.
1380025260073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244763.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 1380025260073 in words is "one trillion, three hundred eighty billion, twenty-five million, two hundred sixty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •