Base | Representation |
---|---|
bin | 1001000111000110000111… |
… | …10101110101111101001111 |
3 | 2121221022212111212022200221 |
4 | 10203203003311311331033 |
5 | 10111223201330442203 |
6 | 110335542531132211 |
7 | 4135324205554060 |
oct | 443430365657517 |
9 | 77838774768627 |
10 | 20035013140303 |
11 | 642488a673627 |
12 | 22b6b05444067 |
13 | b243a8158735 |
14 | 4d39b23c8567 |
15 | 24b253b5eabd |
hex | 1238c3d75f4f |
20035013140303 has 8 divisors (see below), whose sum is σ = 22907143570208. Its totient is φ = 17165379134304.
The previous prime is 20035013140279. The next prime is 20035013140339. The reversal of 20035013140303 is 30304131053002.
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 20035013140303 - 213 = 20035013132111 is a prime.
It is a super-2 number, since 2×200350131403032 (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 (20035013170303) 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, 624088776 + ... + 624120877.
It is an arithmetic number, because the mean of its divisors is an integer number (2863392946276).
Almost surely, 220035013140303 is an apocalyptic number.
20035013140303 is a deficient number, since it is larger than the sum of its proper divisors (2872130429905).
20035013140303 is a wasteful number, since it uses less digits than its factorization.
20035013140303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1248211953.
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 20035013140303 its reverse (30304131053002), we get a palindrome (50339144193305).
The spelling of 20035013140303 in words is "twenty trillion, thirty-five billion, thirteen million, one hundred forty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •