Base | Representation |
---|---|
bin | 1001000111011011110001… |
… | …1111101101100001011111 |
3 | 1022111012221111001110110210 |
4 | 2101312330133231201133 |
5 | 2303210230202143403 |
6 | 33152352233503503 |
7 | 2053106145603210 |
oct | 221667437554137 |
9 | 38435844043423 |
10 | 10023321131103 |
11 | 321495951aa95 |
12 | 115a705b71b93 |
13 | 57926c903697 |
14 | 2691ba531407 |
15 | 125ae2537b03 |
hex | 91dbc7ed85f |
10023321131103 has 64 divisors (see below), whose sum is σ = 17081989005312. Its totient is φ = 5095479191040.
The previous prime is 10023321131101. The next prime is 10023321131111. The reversal of 10023321131103 is 30113112332001.
It is a happy number.
It is not a de Polignac number, because 10023321131103 - 21 = 10023321131101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 10023321131103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023321131101) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10055451 + ... + 11007212.
It is an arithmetic number, because the mean of its divisors is an integer number (266906078208).
Almost surely, 210023321131103 is an apocalyptic number.
10023321131103 is a deficient number, since it is larger than the sum of its proper divisors (7058667874209).
10023321131103 is a wasteful number, since it uses less digits than its factorization.
10023321131103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21062764.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10023321131103 its reverse (30113112332001), we get a palindrome (40136433463104).
The spelling of 10023321131103 in words is "ten trillion, twenty-three billion, three hundred twenty-one million, one hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •