Base | Representation |
---|---|
bin | 1101000011010011101… |
… | …0110010101110000000 |
3 | 210102202201000102202000 |
4 | 3100310322302232000 |
5 | 12133203342023340 |
6 | 251001424024000 |
7 | 22125350426031 |
oct | 3206472625600 |
9 | 712681012660 |
10 | 224226126720 |
11 | 87103891832 |
12 | 37558a62000 |
13 | 181b541c7bb |
14 | abd1780a88 |
15 | 5c75230d30 |
hex | 3434eb2b80 |
224226126720 has 512 divisors, whose sum is σ = 861402729600. Its totient is φ = 54900817920.
The previous prime is 224226126701. The next prime is 224226126743. The reversal of 224226126720 is 27621622422.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12034852 + ... + 12053468.
Almost surely, 2224226126720 is an apocalyptic number.
224226126720 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 224226126720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (430701364800).
224226126720 is an abundant number, since it is smaller than the sum of its proper divisors (637176602880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
224226126720 is a wasteful number, since it uses less digits than its factorization.
224226126720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18703 (or 18685 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 36.
The spelling of 224226126720 in words is "two hundred twenty-four billion, two hundred twenty-six million, one hundred twenty-six thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •