Base | Representation |
---|---|
bin | 10011101001101010111… |
… | …100101000100010000101 |
3 | 11210002122200012112111021 |
4 | 103221222330220202011 |
5 | 134111121441314001 |
6 | 2512212134511141 |
7 | 166364342461003 |
oct | 23515274504205 |
9 | 4702580175437 |
10 | 1350414010501 |
11 | 48078655a486 |
12 | 199876b054b1 |
13 | 9a46087289a |
14 | 49508c89a73 |
15 | 251d9ce9ba1 |
hex | 13a6af28885 |
1350414010501 has 4 divisors (see below), whose sum is σ = 1360271047212. Its totient is φ = 1340556973792.
The previous prime is 1350414010499. The next prime is 1350414010529. The reversal of 1350414010501 is 1050104140531.
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 559577306401 + 790836704100 = 748049^2 + 889290^2 .
It is a cyclic number.
It is not a de Polignac number, because 1350414010501 - 21 = 1350414010499 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 (1350414010601) 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 3 ways as a sum of consecutive naturals, for example, 4928518150 + ... + 4928518423.
It is an arithmetic number, because the mean of its divisors is an integer number (340067761803).
Almost surely, 21350414010501 is an apocalyptic number.
It is an amenable number.
1350414010501 is a deficient number, since it is larger than the sum of its proper divisors (9857036711).
1350414010501 is an equidigital number, since it uses as much as digits as its factorization.
1350414010501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9857036710.
The product of its (nonzero) digits is 1200, while the sum is 25.
The spelling of 1350414010501 in words is "one trillion, three hundred fifty billion, four hundred fourteen million, ten thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •