Base | Representation |
---|---|
bin | 1001010111101000000110… |
… | …11110100000000100010111 |
3 | 2200221121222122021220110202 |
4 | 10223310003132200010113 |
5 | 10200024434202234411 |
6 | 111452521201211115 |
7 | 4224342645160532 |
oct | 453640336400427 |
9 | 80847878256422 |
10 | 20603016446231 |
11 | 66237657342aa |
12 | 2389004630a9b |
13 | b65b18b6346b |
14 | 513296d89a19 |
15 | 25ade994583b |
hex | 12bd037a0117 |
20603016446231 has 8 divisors (see below), whose sum is σ = 20967045356544. Its totient is φ = 20239835101920.
The previous prime is 20603016446137. The next prime is 20603016446269. The reversal of 20603016446231 is 13264461030602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20603016446231 - 230 = 20601942704407 is a prime.
It is a super-2 number, since 2×206030164462312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20603016449231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 211842455 + ... + 211939688.
It is an arithmetic number, because the mean of its divisors is an integer number (2620880669568).
Almost surely, 220603016446231 is an apocalyptic number.
20603016446231 is a deficient number, since it is larger than the sum of its proper divisors (364028910313).
20603016446231 is an equidigital number, since it uses as much as digits as its factorization.
20603016446231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423783001.
The product of its (nonzero) digits is 124416, while the sum is 38.
Adding to 20603016446231 its reverse (13264461030602), we get a palindrome (33867477476833).
The spelling of 20603016446231 in words is "twenty trillion, six hundred three billion, sixteen million, four hundred forty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •