Base | Representation |
---|---|
bin | 1001001101111001101111… |
… | …0101000010101001010010 |
3 | 1022212211202200222212110210 |
4 | 2103132123311002221102 |
5 | 2312020314202133320 |
6 | 33315410512304550 |
7 | 2064121632400533 |
oct | 223363365025122 |
9 | 38784680885423 |
10 | 10134442224210 |
11 | 3257aa1481a27 |
12 | 1178158242156 |
13 | 58689b458095 |
14 | 27071c58468a |
15 | 128947c810e0 |
hex | 9379bd42a52 |
10134442224210 has 32 divisors (see below), whose sum is σ = 24734909839680. Its totient is φ = 2656712537408.
The previous prime is 10134442224161. The next prime is 10134442224229. The reversal of 10134442224210 is 1242224443101.
10134442224210 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 an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2862835017 + ... + 2862838556.
It is an arithmetic number, because the mean of its divisors is an integer number (772965932490).
Almost surely, 210134442224210 is an apocalyptic number.
10134442224210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10134442224210 is an abundant number, since it is smaller than the sum of its proper divisors (14600467615470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10134442224210 is a wasteful number, since it uses less digits than its factorization.
10134442224210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5725673642.
The product of its (nonzero) digits is 12288, while the sum is 30.
Adding to 10134442224210 its reverse (1242224443101), we get a palindrome (11376666667311).
The spelling of 10134442224210 in words is "ten trillion, one hundred thirty-four billion, four hundred forty-two million, two hundred twenty-four thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •