Base | Representation |
---|---|
bin | 1001000111000011010110… |
… | …00101110001000000010111 |
3 | 2121221012000202001101011110 |
4 | 10203201223011301000113 |
5 | 10111212124140021403 |
6 | 110335135100510103 |
7 | 4135242255360333 |
oct | 443415305610027 |
9 | 77835022041143 |
10 | 20033524142103 |
11 | 64241961181aa |
12 | 22b676a84b333 |
13 | b241cb819004 |
14 | 4d38b074a7c3 |
15 | 24b1b808a103 |
hex | 12386b171017 |
20033524142103 has 8 divisors (see below), whose sum is σ = 26735451519600. Its totient is φ = 13343639763008.
The previous prime is 20033524142003. The next prime is 20033524142129. The reversal of 20033524142103 is 30124142533002.
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 20033524142103 - 210 = 20033524141079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20033524142003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3010745718 + ... + 3010752371.
It is an arithmetic number, because the mean of its divisors is an integer number (3341931439950).
Almost surely, 220033524142103 is an apocalyptic number.
20033524142103 is a deficient number, since it is larger than the sum of its proper divisors (6701927377497).
20033524142103 is a wasteful number, since it uses less digits than its factorization.
20033524142103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6021499201.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 20033524142103 its reverse (30124142533002), we get a palindrome (50157666675105).
The spelling of 20033524142103 in words is "twenty trillion, thirty-three billion, five hundred twenty-four million, one hundred forty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •