Base | Representation |
---|---|
bin | 10010010001011111001… |
… | …000001011100100000000 |
3 | 11110001020201211002102111 |
4 | 102101133020023210000 |
5 | 131033211431233324 |
6 | 2400512303225104 |
7 | 156503033355232 |
oct | 22213710134400 |
9 | 4401221732374 |
10 | 1255726430464 |
11 | 444606919100 |
12 | 1834502a8194 |
13 | 9155084aa0c |
14 | 44ac55b4252 |
15 | 229e717a794 |
hex | 1245f20b900 |
1255726430464 has 81 divisors (see below), whose sum is σ = 2755563708891. Its totient is φ = 570695093760.
The previous prime is 1255726430461. The next prime is 1255726430477. The reversal of 1255726430464 is 4640346275521.
The square root of 1255726430464 is 1120592.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1255726430461) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 197221009 + ... + 197227375.
Almost surely, 21255726430464 is an apocalyptic number.
1255726430464 is the 1120592-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1255726430464
1255726430464 is an abundant number, since it is smaller than the sum of its proper divisors (1499837278427).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1255726430464 is an frugal number, since it uses more digits than its factorization.
1255726430464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12772 (or 6380 counting only the distinct ones).
The product of its (nonzero) digits is 4838400, while the sum is 49.
Multiplying 1255726430464 by its sum of digits (49), we get a square (61530595092736 = 78441442).
The spelling of 1255726430464 in words is "one trillion, two hundred fifty-five billion, seven hundred twenty-six million, four hundred thirty thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •