Base | Representation |
---|---|
bin | 1111100010111010100… |
… | …00110010010100110001 |
3 | 1220001201011211012222111 |
4 | 13301131100302110301 |
5 | 32222410000014400 |
6 | 1045214131205321 |
7 | 53406334260643 |
oct | 7613520622461 |
9 | 1801634735874 |
10 | 534140626225 |
11 | 196589505278 |
12 | 8762a746841 |
13 | 3b4a530095b |
14 | 1bbd154a893 |
15 | dd6300e3ba |
hex | 7c5d432531 |
534140626225 has 24 divisors (see below), whose sum is σ = 678602066688. Its totient is φ = 416875699200.
The previous prime is 534140626223. The next prime is 534140626267. The reversal of 534140626225 is 522626041435.
It is a happy number.
It is not a de Polignac number, because 534140626225 - 21 = 534140626223 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (534140626223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 365424 + ... + 1096273.
It is an arithmetic number, because the mean of its divisors is an integer number (28275086112).
Almost surely, 2534140626225 is an apocalyptic number.
534140626225 is the 365425-th decagonal number.
It is an amenable number.
534140626225 is a deficient number, since it is larger than the sum of its proper divisors (144461440463).
534140626225 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (534140626224) it forms a Ruth-Aaron pair, since the sum of their distinct prime factors is the same (1462060).
534140626225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462065 (or 1462060 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 40.
The spelling of 534140626225 in words is "five hundred thirty-four billion, one hundred forty million, six hundred twenty-six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •