Base | Representation |
---|---|
bin | 1101000010100100001… |
… | …0010001001000100000 |
3 | 210102020210212112121202 |
4 | 3100221002101020200 |
5 | 12132301322302322 |
6 | 250525542540332 |
7 | 22120410016100 |
oct | 3205102211040 |
9 | 712223775552 |
10 | 224026759712 |
11 | 870112a1408 |
12 | 375021376a8 |
13 | 18183027662 |
14 | abb30c5200 |
15 | 5c6299e292 |
hex | 3429091220 |
224026759712 has 54 divisors (see below), whose sum is σ = 513104211333. Its totient is φ = 96003436032.
The previous prime is 224026759711. The next prime is 224026759717. The reversal of 224026759712 is 217957620422.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 177507171856 + 46519587856 = 421316^2 + 215684^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=334684.
It is not an unprimeable number, because it can be changed into a prime (224026759711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 18736328 + ... + 18748280.
Almost surely, 2224026759712 is an apocalyptic number.
It is an amenable number.
224026759712 is an abundant number, since it is smaller than the sum of its proper divisors (289077451621).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224026759712 is an frugal number, since it uses more digits than its factorization.
224026759712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23930 (or 11962 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 47.
The spelling of 224026759712 in words is "two hundred twenty-four billion, twenty-six million, seven hundred fifty-nine thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •