Base | Representation |
---|---|
bin | 10010111001001100… |
… | …01100001100000000 |
3 | 222011220200122100000 |
4 | 21130212030030000 |
5 | 131233210343411 |
6 | 4354305200000 |
7 | 506235621051 |
oct | 113446141400 |
9 | 28156618300 |
10 | 10143449856 |
11 | 4335793011 |
12 | 1b71030000 |
13 | c58634b47 |
14 | 6c3224728 |
15 | 3e5796956 |
hex | 25c98c300 |
10143449856 has 324 divisors, whose sum is σ = 31407519416. Its totient is φ = 3264675840.
The previous prime is 10143449851. The next prime is 10143449863. The reversal of 10143449856 is 65894434101.
10143449856 is a `hidden beast` number, since 10 + 143 + 4 + 498 + 5 + 6 = 666.
It is a tau number, because it is divible by the number of its divisors (324).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10143449851) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 104571600 + ... + 104571696.
Almost surely, 210143449856 is an apocalyptic number.
10143449856 is a gapful number since it is divisible by the number (16) 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 10143449856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15703759708).
10143449856 is an abundant number, since it is smaller than the sum of its proper divisors (21264069560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10143449856 is an frugal number, since it uses more digits than its factorization.
10143449856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 210 (or 143 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The spelling of 10143449856 in words is "ten billion, one hundred forty-three million, four hundred forty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •