Base | Representation |
---|---|
bin | 10011101001101100100… |
… | …110000111111101101101 |
3 | 11210002201121020111110110 |
4 | 103221230212013331231 |
5 | 134111201031224430 |
6 | 2512215003330233 |
7 | 166365126515343 |
oct | 23515446077555 |
9 | 4702647214413 |
10 | 1350441664365 |
11 | 4807a0128212 |
12 | 199884220979 |
13 | 9a466505a11 |
14 | 4950c807993 |
15 | 251dc45d7b0 |
hex | 13a6c987f6d |
1350441664365 has 8 divisors (see below), whose sum is σ = 2160706663008. Its totient is φ = 720235554320.
The previous prime is 1350441664339. The next prime is 1350441664367. The reversal of 1350441664365 is 5634661440531.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1350441664365 - 210 = 1350441663341 is a prime.
It is a super-2 number, since 2×13504416643652 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350441664367) 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, 45014722131 + ... + 45014722160.
It is an arithmetic number, because the mean of its divisors is an integer number (270088332876).
Almost surely, 21350441664365 is an apocalyptic number.
1350441664365 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1350441664365 is a deficient number, since it is larger than the sum of its proper divisors (810264998643).
1350441664365 is an equidigital number, since it uses as much as digits as its factorization.
1350441664365 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90029444299.
The product of its (nonzero) digits is 3110400, while the sum is 48.
The spelling of 1350441664365 in words is "one trillion, three hundred fifty billion, four hundred forty-one million, six hundred sixty-four thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •