Base | Representation |
---|---|
bin | 1001010011001000001100… |
… | …1000100101101000000010 |
3 | 1100012102111121220202201000 |
4 | 2110302003020211220002 |
5 | 2320003201342343132 |
6 | 33424535353352430 |
7 | 2103450521016561 |
oct | 224620310455002 |
9 | 40172447822630 |
10 | 10224222231042 |
11 | 32920829a4986 |
12 | 1191633408716 |
13 | 5921a8812a91 |
14 | 274bd8177bd8 |
15 | 12ae4eb5487c |
hex | 94c83225a02 |
10224222231042 has 32 divisors (see below), whose sum is σ = 22994234746560. Its totient is φ = 3367012942080.
The previous prime is 10224222231001. The next prime is 10224222231061. The reversal of 10224222231042 is 24013222242201.
10224222231042 is a `hidden beast` number, since 1 + 0 + 2 + 2 + 422 + 2 + 231 + 0 + 4 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 10224222230997 and 10224222231015.
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, 1140582559 + ... + 1140591522.
It is an arithmetic number, because the mean of its divisors is an integer number (718569835830).
Almost surely, 210224222231042 is an apocalyptic number.
10224222231042 is an abundant number, since it is smaller than the sum of its proper divisors (12770012515518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10224222231042 is a wasteful number, since it uses less digits than its factorization.
10224222231042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2281174175 (or 2281174169 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 10224222231042 its reverse (24013222242201), we get a palindrome (34237444473243).
The spelling of 10224222231042 in words is "ten trillion, two hundred twenty-four billion, two hundred twenty-two million, two hundred thirty-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •