Base | Representation |
---|---|
bin | 11010100101101000010… |
… | …01110111010101110001 |
3 | 10020100001020221110020001 |
4 | 31102310021313111301 |
5 | 104431430210122401 |
6 | 1535403121550001 |
7 | 123000521031100 |
oct | 15226411672561 |
9 | 3210036843201 |
10 | 913555551601 |
11 | 322489324400 |
12 | 129077aa5301 |
13 | 681bcc93164 |
14 | 32305848037 |
15 | 18b6c61b601 |
hex | d4b4277571 |
913555551601 has 27 divisors (see below), whose sum is σ = 1168194066123. Its totient is φ = 711804120720.
The previous prime is 913555551599. The next prime is 913555551673. The reversal of 913555551601 is 106155555319.
The square root of 913555551601 is 955801.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 273753936225 + 639801615376 = 523215^2 + 799876^2 .
It is not a de Polignac number, because 913555551601 - 21 = 913555551599 is a prime.
It is a super-2 number, since 2×9135555516012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (913555551101) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 73590471 + ... + 73602883.
Almost surely, 2913555551601 is an apocalyptic number.
913555551601 is the 955801-st square number.
913555551601 is the 477901-st centered octagonal number.
It is an amenable number.
913555551601 is a deficient number, since it is larger than the sum of its proper divisors (254638514522).
913555551601 is an frugal number, since it uses more digits than its factorization.
913555551601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24862 (or 12431 counting only the distinct ones).
The product of its (nonzero) digits is 506250, while the sum is 46.
The spelling of 913555551601 in words is "nine hundred thirteen billion, five hundred fifty-five million, five hundred fifty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •