Base | Representation |
---|---|
bin | 11001010111010… |
… | …111011010111001 |
3 | 1002122202110121001 |
4 | 121113113122321 |
5 | 1332420240031 |
6 | 110121045001 |
7 | 13355110000 |
oct | 3127273271 |
9 | 1078673531 |
10 | 425555641 |
11 | 1a9240285 |
12 | ba626761 |
13 | 6a21b694 |
14 | 40737c37 |
15 | 27560861 |
hex | 195d76b9 |
425555641 has 15 divisors (see below), whose sum is σ = 497634063. Its totient is φ = 363895560.
The previous prime is 425555639. The next prime is 425555653. The reversal of 425555641 is 146555524.
The square root of 425555641 is 20629.
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., 2019241 + 423536400 = 1421^2 + 20580^2 .
It is not a de Polignac number, because 425555641 - 21 = 425555639 is a prime.
It is a super-3 number, since 3×4255556413 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 425555641.
It is not an unprimeable number, because it can be changed into a prime (425555621) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 1010611 + ... + 1011031.
Almost surely, 2425555641 is an apocalyptic number.
425555641 is the 20629-th square number.
425555641 is the 10315-th centered octagonal number.
It is an amenable number.
425555641 is a deficient number, since it is larger than the sum of its proper divisors (72078422).
425555641 is an frugal number, since it uses more digits than its factorization.
425555641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 870 (or 428 counting only the distinct ones).
The product of its digits is 120000, while the sum is 37.
The cubic root of 425555641 is about 752.1748081099.
The spelling of 425555641 in words is "four hundred twenty-five million, five hundred fifty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •