Base | Representation |
---|---|
bin | 1001001010000000100011… |
… | …00011111011001010001011 |
3 | 2122021220012211102100002002 |
4 | 10211000101203323022023 |
5 | 10114343141414014200 |
6 | 110453534324101215 |
7 | 4145466403156565 |
oct | 445002143731213 |
9 | 78256184370062 |
10 | 20135101313675 |
11 | 6463280852687 |
12 | 231239883480b |
13 | b30968cca86a |
14 | 4d878903c335 |
15 | 24db609b4bd5 |
hex | 1250118fb28b |
20135101313675 has 12 divisors (see below), whose sum is σ = 24969881162376. Its totient is φ = 16106561352000.
The previous prime is 20135101313647. The next prime is 20135101313707. The reversal of 20135101313675 is 57631310153102.
It is not a de Polignac number, because 20135101313675 - 238 = 19860223406731 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 37722149 + ... + 38252198.
It is an arithmetic number, because the mean of its divisors is an integer number (2080823430198).
Almost surely, 220135101313675 is an apocalyptic number.
20135101313675 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
20135101313675 is a deficient number, since it is larger than the sum of its proper divisors (4834779848701).
20135101313675 is a wasteful number, since it uses less digits than its factorization.
20135101313675 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75984958 (or 75984953 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 38.
Adding to 20135101313675 its reverse (57631310153102), we get a palindrome (77766411466777).
The spelling of 20135101313675 in words is "twenty trillion, one hundred thirty-five billion, one hundred one million, three hundred thirteen thousand, six hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •