Base | Representation |
---|---|
bin | 110000010110110111000011… |
… | …1100010000111100101011000 |
3 | 2001210001110221200202021212222 |
4 | 1200231232013202013211120 |
5 | 421223001212131334410 |
6 | 4104353032334523212 |
7 | 155410560365161142 |
oct | 14055560742074530 |
9 | 2053043850667788 |
10 | 425354360027480 |
11 | 1135928532a7734 |
12 | 3b858636666508 |
13 | 15345989870180 |
14 | 7707391b91c92 |
15 | 342969a3c9955 |
hex | 182db87887958 |
425354360027480 has 32 divisors (see below), whose sum is σ = 1030666333914000. Its totient is φ = 157053917548416.
The previous prime is 425354360027459. The next prime is 425354360027501. The reversal of 425354360027480 is 84720063453524.
It is an interprime number because it is at equal distance from previous prime (425354360027459) and next prime (425354360027501).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 408994576430 + ... + 408994577469.
Almost surely, 2425354360027480 is an apocalyptic number.
425354360027480 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
425354360027480 is an abundant number, since it is smaller than the sum of its proper divisors (605311973886520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425354360027480 is a wasteful number, since it uses less digits than its factorization.
425354360027480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817989153923 (or 817989153919 counting only the distinct ones).
The product of its (nonzero) digits is 19353600, while the sum is 53.
The spelling of 425354360027480 in words is "four hundred twenty-five trillion, three hundred fifty-four billion, three hundred sixty million, twenty-seven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •