Base | Representation |
---|---|
bin | 101110101010001110… |
… | …1101111100110111011 |
3 | 100120122012111000122021 |
4 | 1131110131233212323 |
5 | 3120203020044011 |
6 | 114010514135311 |
7 | 10145040155506 |
oct | 1352435574673 |
9 | 316565430567 |
10 | 100201331131 |
11 | 3954a048170 |
12 | 17505281537 |
13 | 95ab4418a5 |
14 | 4bc7aac13d |
15 | 2916c58471 |
hex | 175476f9bb |
100201331131 has 4 divisors (see below), whose sum is σ = 109310543064. Its totient is φ = 91092119200.
The previous prime is 100201331129. The next prime is 100201331147. The reversal of 100201331131 is 131133102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100201331131 - 21 = 100201331129 is a prime.
It is a super-2 number, since 2×1002013311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100201331101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4554605950 + ... + 4554605971.
It is an arithmetic number, because the mean of its divisors is an integer number (27327635766).
Almost surely, 2100201331131 is an apocalyptic number.
100201331131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100201331131 is a deficient number, since it is larger than the sum of its proper divisors (9109211933).
100201331131 is an equidigital number, since it uses as much as digits as its factorization.
100201331131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9109211932.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 100201331131 its reverse (131133102001), we get a palindrome (231334433132).
The spelling of 100201331131 in words is "one hundred billion, two hundred one million, three hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •