Base | Representation |
---|---|
bin | 1001000111010111010100… |
… | …1010001101001000111111 |
3 | 1022111002212002000201002010 |
4 | 2101311311022031020333 |
5 | 2303200302310423403 |
6 | 33152033401502303 |
7 | 2053034404031112 |
oct | 221656512151077 |
9 | 38432762021063 |
10 | 10022124311103 |
11 | 32143a4996453 |
12 | 115a4311a1993 |
13 | 57910b983778 |
14 | 2691055cc579 |
15 | 125a72429603 |
hex | 91d7528d23f |
10022124311103 has 16 divisors (see below), whose sum is σ = 13523347733760. Its totient is φ = 6601273783104.
The previous prime is 10022124311063. The next prime is 10022124311113. The reversal of 10022124311103 is 30111342122001.
It is not a de Polignac number, because 10022124311103 - 220 = 10022123262527 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10022124311103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022124311113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14055801 + ... + 14751602.
It is an arithmetic number, because the mean of its divisors is an integer number (845209233360).
Almost surely, 210022124311103 is an apocalyptic number.
10022124311103 is a deficient number, since it is larger than the sum of its proper divisors (3501223422657).
10022124311103 is a wasteful number, since it uses less digits than its factorization.
10022124311103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28808798.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 10022124311103 its reverse (30111342122001), we get a palindrome (40133466433104).
The spelling of 10022124311103 in words is "ten trillion, twenty-two billion, one hundred twenty-four million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •