Base | Representation |
---|---|
bin | 1001011110110010010010… |
… | …1101100001110100111000 |
3 | 1100220120110102202221002010 |
4 | 2113230210231201310320 |
5 | 2331243334343322300 |
6 | 34100541102205520 |
7 | 2124100603045044 |
oct | 227544455416470 |
9 | 40816412687063 |
10 | 10424501542200 |
11 | 335a008399749 |
12 | 12044085838a0 |
13 | 5a8045967c15 |
14 | 2807973a5024 |
15 | 13127289ca50 |
hex | 97b24b61d38 |
10424501542200 has 96 divisors (see below), whose sum is σ = 32332028117760. Its totient is φ = 2778484425600.
The previous prime is 10424501542177. The next prime is 10424501542291. The reversal of 10424501542200 is 224510542401.
10424501542200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3113184 + ... + 5526383.
It is an arithmetic number, because the mean of its divisors is an integer number (336791959560).
Almost surely, 210424501542200 is an apocalyptic number.
10424501542200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10424501542200 is an abundant number, since it is smaller than the sum of its proper divisors (21907526575560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10424501542200 is a wasteful number, since it uses less digits than its factorization.
10424501542200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8641597 (or 8641588 counting only the distinct ones).
The product of its (nonzero) digits is 12800, while the sum is 30.
The spelling of 10424501542200 in words is "ten trillion, four hundred twenty-four billion, five hundred one million, five hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •