Base | Representation |
---|---|
bin | 10000101010110101110… |
… | …101100011001001111101 |
3 | 11001111202200221122120222 |
4 | 100222311311203021331 |
5 | 122232002033430321 |
6 | 2234124013551125 |
7 | 145521566316233 |
oct | 20526565431175 |
9 | 4044680848528 |
10 | 1145512014461 |
11 | 40189973a091 |
12 | 1660117a54a5 |
13 | 84037ab9c49 |
14 | 3d62bb38953 |
15 | 1ebe632c3ab |
hex | 10ab5d6327d |
1145512014461 has 8 divisors (see below), whose sum is σ = 1150496943360. Its totient is φ = 1140528685968.
The previous prime is 1145512014457. The next prime is 1145512014473. The reversal of 1145512014461 is 1644102155411.
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 1145512014461 - 22 = 1145512014457 is a prime.
It is a super-6 number, since 6×11455120144616 (a number of 74 digits) contains 666666 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145512014421) 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, 1045880 + ... + 1839806.
It is an arithmetic number, because the mean of its divisors is an integer number (143812117920).
Almost surely, 21145512014461 is an apocalyptic number.
It is an amenable number.
1145512014461 is a deficient number, since it is larger than the sum of its proper divisors (4984928899).
1145512014461 is an equidigital number, since it uses as much as digits as its factorization.
1145512014461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 800203.
The product of its (nonzero) digits is 19200, while the sum is 35.
Adding to 1145512014461 its reverse (1644102155411), we get a palindrome (2789614169872).
The spelling of 1145512014461 in words is "one trillion, one hundred forty-five billion, five hundred twelve million, fourteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •