Base | Representation |
---|---|
bin | 101110101000001000… |
… | …1011111100111000101 |
3 | 100120110022011101120110 |
4 | 1131100101133213011 |
5 | 3120032014323023 |
6 | 113555523023233 |
7 | 10143224356545 |
oct | 1352021374705 |
9 | 316408141513 |
10 | 100131011013 |
11 | 39513388670 |
12 | 174a580ab19 |
13 | 95999c0457 |
14 | 4bbc605325 |
15 | 29109b7a93 |
hex | 175045f9c5 |
100131011013 has 16 divisors (see below), whose sum is σ = 145652322816. Its totient is φ = 60682454640.
The previous prime is 100131010997. The next prime is 100131011039. The reversal of 100131011013 is 310110131001.
It is not a de Polignac number, because 100131011013 - 24 = 100131010997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100131011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100131011093) 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 15 ways as a sum of consecutive naturals, for example, 729606 + ... + 855912.
It is an arithmetic number, because the mean of its divisors is an integer number (9103270176).
Almost surely, 2100131011013 is an apocalyptic number.
It is an amenable number.
100131011013 is a deficient number, since it is larger than the sum of its proper divisors (45521311803).
100131011013 is a wasteful number, since it uses less digits than its factorization.
100131011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150344.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 100131011013 its reverse (310110131001), we get a palindrome (410241142014).
It can be divided in two parts, 1001 and 31011013, that multiplied together give a palindrome (31042024013).
The spelling of 100131011013 in words is "one hundred billion, one hundred thirty-one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •