Base | Representation |
---|---|
bin | 10100100101111100011… |
… | …010010010001111110001 |
3 | 12000021200221120221000000 |
4 | 110211330122102033301 |
5 | 141141142131140044 |
6 | 3002034043220213 |
7 | 204145164220611 |
oct | 24457432221761 |
9 | 5007627527000 |
10 | 1415131505649 |
11 | 4a617692a464 |
12 | 1aa318817669 |
13 | a35a5777b04 |
14 | 4c6c80a2a41 |
15 | 26c2679dd69 |
hex | 1497c6923f1 |
1415131505649 has 21 divisors (see below), whose sum is σ = 2121774818313. Its totient is φ = 943399591092.
The previous prime is 1415131505639. The next prime is 1415131505651. The reversal of 1415131505649 is 9465051315141.
The square root of 1415131505649 is 1189593.
It is a perfect power (a square), and thus also a powerful number.
1415131505649 is a `hidden beast` number, since 1 + 4 + 1 + 5 + 1 + 31 + 50 + 564 + 9 = 666.
It is not a de Polignac number, because 1415131505649 - 219 = 1415130981361 is a prime.
It is a super-2 number, since 2×14151315056492 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1415131505609) by changing a digit.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 32096982 + ... + 32141040.
Almost surely, 21415131505649 is an apocalyptic number.
1415131505649 is the 1189593-rd square number.
1415131505649 is the 594797-th centered octagonal number.
It is an amenable number.
1415131505649 is a deficient number, since it is larger than the sum of its proper divisors (706643312664).
1415131505649 is an frugal number, since it uses more digits than its factorization.
1415131505649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88136 (or 44062 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 45.
The spelling of 1415131505649 in words is "one trillion, four hundred fifteen billion, one hundred thirty-one million, five hundred five thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •