Base | Representation |
---|---|
bin | 10111011011010011010010… |
… | …001001001111000111001011 |
3 | 111111210200112120000120211110 |
4 | 113123103102021033013023 |
5 | 102001030344442224003 |
6 | 1003043514054501403 |
7 | 30462521132512563 |
oct | 2733232211170713 |
9 | 444720476016743 |
10 | 103031201133003 |
11 | 2a913318026990 |
12 | b680178964863 |
13 | 4564a53b3b010 |
14 | 1b62a45899da3 |
15 | bda1282eda03 |
hex | 5db4d224f1cb |
103031201133003 has 64 divisors (see below), whose sum is σ = 162942172968960. Its totient is φ = 57086486899200.
The previous prime is 103031201132989. The next prime is 103031201133017. The reversal of 103031201133003 is 300331102130301.
It is an interprime number because it is at equal distance from previous prime (103031201132989) and next prime (103031201133017).
It is not a de Polignac number, because 103031201133003 - 212 = 103031201128907 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103031201133023) 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, 108621198 + ... + 109565628.
It is an arithmetic number, because the mean of its divisors is an integer number (2545971452640).
Almost surely, 2103031201133003 is an apocalyptic number.
103031201133003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103031201133003 is a deficient number, since it is larger than the sum of its proper divisors (59910971835957).
103031201133003 is a wasteful number, since it uses less digits than its factorization.
103031201133003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946900.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103031201133003 its reverse (300331102130301), we get a palindrome (403362303263304).
The spelling of 103031201133003 in words is "one hundred three trillion, thirty-one billion, two hundred one million, one hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •