Base | Representation |
---|---|
bin | 1001001001000100110000… |
… | …10110111111111100111111 |
3 | 2122011211100211222201001100 |
4 | 10210202120112333330333 |
5 | 10113331422244024411 |
6 | 110431105300144143 |
7 | 4143252105021465 |
oct | 444423026777477 |
9 | 78154324881040 |
10 | 20103003111231 |
11 | 64506aa199047 |
12 | 230811b098053 |
13 | b2a922026b71 |
14 | 4d6dc2094835 |
15 | 24cdd2a7b456 |
hex | 1248985bff3f |
20103003111231 has 24 divisors (see below), whose sum is σ = 29187235584000. Its totient is φ = 13333080296592.
The previous prime is 20103003111187. The next prime is 20103003111239. The reversal of 20103003111231 is 13211130030102.
20103003111231 is a `hidden beast` number, since 2 + 0 + 10 + 300 + 311 + 12 + 31 = 666.
It is not a de Polignac number, because 20103003111231 - 211 = 20103003109183 is a prime.
It is a super-2 number, since 2×201030031112312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20103003111239) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2262651 + ... + 6732428.
It is an arithmetic number, because the mean of its divisors is an integer number (1216134816000).
Almost surely, 220103003111231 is an apocalyptic number.
20103003111231 is a deficient number, since it is larger than the sum of its proper divisors (9084232472769).
20103003111231 is a wasteful number, since it uses less digits than its factorization.
20103003111231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8996363 (or 8996360 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 20103003111231 its reverse (13211130030102), we get a palindrome (33314133141333).
The spelling of 20103003111231 in words is "twenty trillion, one hundred three billion, three million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •